PAT甲级1123 Is It a Complete AVL Tree (30 分)

1123 Is It a Complete AVL Tree (30 分)

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 output the level-order traversal sequence of the resulting AVL tree, and to tell if it is a complete binary tree.

Each input file contains one test case. For each case, the first line contains a positive integer N (≤ 20). 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, insert the keys one by one into an initially empty AVL tree. Then first print in a line the level-order traversal sequence of the resulting AVL tree. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line. Then in the next line, print YES if the tree is complete, or NO if not.

Sample Input 1:

5

88 70 61 63 65

Sample Output 1:

70 63 88 61 65

YES

Sample Input 2:

8

88 70 61 96 120 90 65 68

Sample Output 2:

88 65 96 61 70 90 120 68

NO

      题目大意：

给出长度为n的序列，构建AVL树，输出层序并判定是否为完全二叉树。

思路：

         用链表结构存储比较方便左旋等操作的算法构写。存储好后，层序一趟，并进行相应的判断。如果发现在任一一处左子树没有着置l = false， 如果l == false && 有右子树，那么肯定不是完全二叉树， 就让isct = false。

         注意：当有n = 5， 5 2 7 1 6，

                   输出 5 2 7 1 6

NO

测试点2， 3 基本是这样的例子。如果你狭隘的认为左边为空只是左子树会发生的情况那就错了，有可能是左子树的某个结点的右孩子没有，然后该结点右兄弟有左孩子，这种情况也应该不是完全二叉树。所以应当是左子树某个结点存在了没有孩子的情况，那么l = false，这种情况有可能是左孩子为空，或者右孩子为空。

参考代码：