首页 > 试题广场 >

Root of AVL Tree (25)

[编程题]Root of AVL Tree (25)

热度指数：2415 时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 64M，其他语言128M
算法知识视频讲解

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.

输入描述:

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.

输出描述:

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

示例1

输入

5
88 70 61 96 120

输出

算法知识视频讲解

懒散之魂

发表于 2021-10-13 01:23:04

C++手写AVL树全面详解 AVL树简介 AVL树的名字来源于它的发明作者G.M. Adelson-Velsky 和 E.M. Landis。AVL树是最先发明的自平衡二叉查找树（Self-Balancing Binary Search Tree,简称平衡二叉树）。一棵AVL树有如下必要条件：展开全文