PAT-Advanced-1066. Root of AVL Tree

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.

Output Specification:

For each test case, print ythe root of the resulting AVL tree in one line.

Sample Input 1:

Sample Output 1:

Sample Input 2:

Sample Output 2:

偷懒写了递归版……

代码如下:

 

2 评论

    1. 我 PAT-Advanced 没有按照顺序做,更新时也是随便更的,现在想想似乎中间还有几道题没做,所以显得有点乱……(不过我也懒得调顺序了

发表评论

电子邮件地址不会被公开。 必填项已用*标注