AVL树

最新推荐文章于 2024-11-16 07:15:00 发布

Vvvvvvvvvvic

最新推荐文章于 2024-11-16 07:15:00 发布

阅读量170

点赞数 1

CC 4.0 BY-SA版权

分类专栏：数据结构与算法

本文链接：https://blog.youkuaiyun.com/qq_41102235/article/details/86004339

数据结构与算法专栏收录该内容

5 篇文章

订阅专栏

本文详细介绍了AVL树的四种旋转操作：左旋、右旋、左右旋和右左旋，以及如何通过这些旋转保持AVL树的平衡。在插入节点的过程中，通过判断子树的高度差来决定进行哪种旋转，确保树的高度平衡，从而实现高效的查找、插入和删除操作。

#include <iostream>

#define MAX 2; 

using namespace std;

struct treenode{
	int key;
	int high;
	treenode* left;
	treenode* right;
}; 
class autoTree{
public:

	int maxH(int a,int b);
	treenode* Lrotate(treenode* node);//向左转 ，即转到左下角 RR
	treenode* Rrotate(treenode* node);//向右转 LL
	treenode* RL(treenode* node);//RL
	treenode* LR(treenode* node);//LR
	treenode* insertnode(treenode* node,int key);
	int printH(treenode* root);//输出高度 
}; 


int autoTree::maxH(int a,int b){
	if(a>b)return a;
	else return b;
}
treenode* autoTree::Lrotate(treenode* node){//RR 
	treenode* temp=node->right;
	node->right=temp->left;
	temp->left=node;
	node->high=max(node->left->high,node->right->high)+1;
	temp->high=max(temp->left->high,temp->right->high)+1;
	return temp;
}
treenode* autoTree::Rrotate(treenode* node){//LL
	treenode* temp=node->left;
	node->left=temp->right;
	temp->right=node;
	node->high=max(node->left->high,node->right->high)+1;
	temp->high=max(temp->left->high,temp->right->high)+1;
	return temp;
} 
treenode* autoTree::RL(treenode* node){
	node->right=Rrotate(node->right);
	return Lrotate(node);
}
treenode* autoTree::LR(treenode* node){
	node->left=Lrotate(node->left);
	return Rrotate(node);
}
treenode* autoTree::insertnode(treenode* node,int key){
	if(!node){
	
		//node=initTree(key);
		node=new treenode();
		node->high=0;
		node->key=key;
		node->left=node->right=NULL;
		//	cout<<"succeed1"<<endl;
	}
	else if(key>node->key){
		node->right=insertnode(node->right,key);
		if(node->right->high-node->left->high>1){
			if(key>node->right->key)node=Lrotate(node);
			else{
				node=RL(node);
				//node->right=Rrotate(node->right);
			}
		}
	}
	else if(key<node->key){
		node->left=insertnode(node->left,key);
		if(node->left->high-node->right->high>1){
			if(key<node->left->key)node=Rrotate(node);
			else node=LR(node);
		}
	}
	node->high=maxH(node->left->high,node->right->high)+1;
	return node;
}
int autoTree::printH(treenode* root){
	cout<<root->high;
}