04-树5 Root of AVL Tree（25 分）

最新推荐文章于 2019-05-22 21:53:05 发布

qq_38419968

最新推荐文章于 2019-05-22 21:53:05 发布

阅读量593

点赞数

分类专栏：数据结构平衡二叉树文章标签：平衡二叉树

本文链接：https://blog.csdn.net/qq_38419968/article/details/78397513

版权

这道题目要求根据给定的一系列插入操作，确定最终形成的AVL树的根节点。AVL树是一种自我平衡的二叉搜索树，确保任意节点的两个子树高度差不超过1。当不平衡发生时，通过旋转规则进行调整。输入包含插入的整数序列，输出是平衡后的AVL树的根节点值。

摘要由CSDN通过智能技术生成

04-树5 Root of AVL Tree（25 分）

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 the root of the resulting AVL tree in one line.

Sample Input 1:

5
88 70 61 96 120
Sample Output 1:

70
Sample Input 2:

7
88 70 61 96 120 90 65
Sample Output 2:

题目主要考察平衡二叉树的调整。
编写的代码如下：

#include <stdio.h>
#include <stdlib.h>

typedef struct TreeNode *AVLTree;
struct TreeNode
{
    int Data;
    int Height;
    AVLTree Left,Right;
};
AVLTree Insert(AVLTree T,int x);
int GetHeight(AVLTree T);
int Max(int a,int b);
AVLTree SingleLeftRotation(AVLTree A);
AVLTree SingleRightRotation(AVLTree A);
AVLTree DoubleLeftRightRotat