首页 > 试题广场 >

Root of AVL Tree (25)

[编程题]Root of AVL Tree (25)
  • 热度指数：2429 时间限制：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

输出

70
算法知识视频讲解
添加回答

这道题你会答吗？花几分钟告诉大家答案吧！

提交观点

问题信息

树 高级结构 排序
难度：
0条回答 14296浏览

热门推荐

通过挑战的用户

相关试题

Root of AVL Tree (25)

扫一扫，把题目装进口袋

求职之前，先上牛客

扫描二维码，进入QQ群

扫描二维码，关注牛客公众号