PAT A1066 Root of AVL Tree

最新推荐文章于 2024-01-31 08:08:57 发布

wdkhuans

最新推荐文章于 2024-01-31 08:08:57 发布

阅读量242

点赞数

文章标签： c++

本文链接：https://blog.csdn.net/weixin_41809001/article/details/105487966

版权

平衡二叉树

#include<cstdio> 
#include<algorithm>
using namespace std;
struct node{
	int v, height;
	node *lchild, *rchild;
}*root;

node* newNode(int v){
	node* Node = new node;
	Node->v = v;
	Node->height = 1;
	Node->lchild = Node->rchild = NULL;
	return Node;
}

int getHeight(node* root){
	if(root == NULL) return 0;
	return root->height;
}

void updateHeight(node* root){
	root->height = max( getHeight(root->lchild), getHeight(root->rchild) ) + 1;
}

int getBalanceFactor(node* root){
	return getHeight(root->lchild) - getHeight(root->rchild);
}

void L(node* &root){
	node* temp = root->rchild;
	root->rchild = temp->lchild;
	temp->lchild = root;
	updateHeight(root);
	updateHeight(temp);
	root = temp;
}

void R(node* &root){
	node* temp = root->lchild;
	root->lchild = temp->rchild;
	temp->rchild = root;
	updateHeight(root);
	updateHeight(temp);
	root = temp;
}

void insert(node* &root, int v){
	if(root == NULL) {
		root = newNode(v);
		return;
	}
	if(v < root->v){
		insert(root->lchild, v);
		updateHeight(root);
		if(getBalanceFactor(root) == 2){
			if(getBalanceFactor(root->lchild) == 1) R(root);
			else if(getBalanceFactor(root->lchild) == -1){
				L(root->lchild);
				R(root);
			}
		}
    }
		else{
			insert(root->rchild, v);
			updateHeight(root);
			if(getBalanceFactor(root) == -2){
			    if(getBalanceFactor(root->rchild) == -1) L(root);
			        else if(getBalanceFactor(root->rchild) == 1){
				        R(root->rchild);
				        L(root);
			           }
		        }
		    }
	     
}

node* Create(int data[], int n){
	node* root = NULL;
	for(int i = 0; i < n; i++){
		insert(root,data[i]);
	}
	return root;
}


int main(){
	int n, v;
	scanf("%d",&n);
	for(int i = 0; i < n; i++){
		scanf("%d",&v);
		insert(root,v);
	}
	printf("%d\n",root->v);
	return 0;
}