PAT-A1123 Is It a Complete AVL Tree 题目内容及题解

最新推荐文章于 2022-09-06 17:19:15 发布

Bourbon_Whiskey_

最新推荐文章于 2022-09-06 17:19:15 发布

阅读量507

点赞数

分类专栏： PAT甲级文章标签： PAT 甲级 OJ 编程学习

本文链接：https://blog.youkuaiyun.com/Bourbon_Whiskey_/article/details/86776136

版权

本文介绍了PAT甲级编程题A1123，涉及AVL树的构建及判断是否为完全二叉树。通过对给定的插入序列进行AVL树的插入操作，然后通过层次遍历得到AVL树的序列，并判断是否为完全二叉树。题目给出了样例输入和输出。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Input Specification:

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.