Now given a sequence of insertions, you are supposed to tell the root of the resulting AVL tree.
[编程题]Root of AVL Tree (25)
- 热度指数：2426 时间限制：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.
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条回答
18收藏
14073浏览
通过挑战的用户
-
2023-02-28 17:31:44
-
2023-02-27 11:08:09
-
2023-02-23 21:32:14
-
2023-02-23 21:14:54
-
2023-02-23 16:57:47
-
扫描二维码，关注牛客网
- 意见反馈
-
下载牛客APP，随时随地刷题
扫一扫，把题目装进口袋
- 求职之前，先上牛客
-
扫描二维码，进入QQ群
扫描二维码，关注牛客公众号
- 公司地址：北京市朝阳区北苑路北美国际商务中心K2座一层-北京牛客科技有限公司
- 联系方式：010-60728802 投诉举报电话：010-57596212（朝阳人力社保局）
- 牛客科技© All rights reserved admin@nowcoder.com
- 京ICP备14055008号-4 增值电信业务经营许可证 营业执照 人力资源服务许可证
-
京公网安备
11010502036488号
