数据结构（陈越）PAT练习题第四周：树（下）

最新推荐文章于 2022-10-09 00:15:29 发布

原创

最新推荐文章于 2022-10-09 00:15:29 发布 · 1.5k 阅读

2 ·

CC 4.0 BY-SA版权

文章标签：

#数据结构 #PAT

04-1. Root of AVL Tree

时间限制

100 ms

内存限制

65536 kB

代码长度限制

8000 B

判题程序

Standard

作者

CHEN, Yue

An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Figures 1-4 illustrate the rotation rules.

Now given a sequence of insertions, you are supposed to tell the root of the resulting AVL tree.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (<=20) which is the total number of keys to be inserted. Then N distinct integer keys are given in the next line. All the numbers in a line are separated by a space.