HDU 2193 AVL树(给节点求最大高度)

最新推荐文章于 2026-05-05 15:28:29 发布

原创最新推荐文章于 2026-05-05 15:28:29 发布 · 7.2k 阅读

4 ·

本内容遵循CC 4.0 BY-SA版权协议

树专栏收录该内容

3 篇文章

订阅专栏

本文介绍AVL树的基本概念及性质，并通过一个具体算法实现计算具有特定节点数的AVL树的最大高度，适用于理解平衡二叉搜索树的平衡原理及其高度计算。

连接: http://acm.split.hdu.edu.cn/showproblem.php?pid=2193

AVL Tree

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 534 Accepted Submission(s): 252

Problem Description

An AVL tree is a kind of balanced binary search tree. Named after their inventors, Adelson-Velskii and Landis, they were the first dynamically balanced trees to be proposed. Like red-black trees, they are not perfectly balanced, but pairs of sub-trees differ in height by at most 1, maintaining an O(logn) search time. Addition and deletion operations also take O(logn) time.
Definition of an AVL tree
An AVL tree is a binary search tree which has the following properties:
1. The sub-trees of every node differ in height by at most one.
2. Every sub-tree is an AVL tree.

Balance requirement for an AVL tree: the left and right sub-trees differ by at most 1 in height.An AVL tree of n nodes can have different height.
For example, n = 7:

So the maximal height of the AVL Tree with 7 nodes is 3.
Given n,the number of vertices, you are to calculate the maximal hight of the AVL tree with n nodes.

Input

Input file contains multiple test cases. Each line of the input is an integer n(0<n<=10^9).
A line with a zero ends the input.

Output

An integer each line representing the maximal height of the AVL tree with n nodes.

Sample Input

Sample Output

0
1

题意:

计算出有n个点的AVL树的最大高度,根节点不算高度

首先有一个公式:

设n[h]是高度为h的平衡二叉树的最小节点数,则n[h]=n[h-1]+n[h-2]

给定节点数为n的AVL树的最大高度为O(log2 n)

注意:

如果值是10^9 ,即1亿, 计算斐波那契到第45项就是11亿了,所以如果是int存储的话只用算到44项

找到一个不大于n的a[i] ,则最大高度就是i, 且 a[i-1]<= n <a[i]

//hdu 2193 AVL(给n个节点求平衡二叉树最大高度)
#include <iostream>
using namespace std;
//计算出有n个点的AVL树的最大高度,根节点不算高度 
//求最大高度 即 '使得放入的节点数尽量地少'
int a[46];
int n;
int main()
{
	a[0]=1;a[1]=2;
	for (int i=2;i<=45;i++)
		a[i]=a[i-1]+a[i-2]+1;
	while (~scanf("%d",&n),n)
	{
		int ans=0;
		while (a[ans]<=n) ans++;
		printf("%d\n",--ans);
	}
	return 0;
}