⭐【平衡二叉树模板题】PAT A1066 Root of AVL Tree (25分)

疑问

暂无

代码

#include<cstdio>
#include<algorithm>

using namespace std;

const int maxn = 30;

int data[maxn];

struct node{
	int v;
	int height;
	node* lchild;
	node* rchild;
};

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

int getHeight(node* root){
	if(root == NULL){
		return 0;
	}else{
		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){
		node* Node = newNode(v);
		root = Node;
		return;
	}else 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;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&data[i]);
	}
	node* root = Create(data,n);
	printf("%d",root->v);
	return 0;
}

反思

1. 之前测试点5没有过，后来检查发现是自己在左旋L和右旋R中，把updateHeight(root);
updateHeight(temp);的顺序写反了，导致错误，改了之后就好了。由此可见，自己对AVL树并不是很熟悉，思路还是不清晰；
2. 传统的AVL树题目解题思路还是很清楚的。
   • newNode();
   • Create();
   • insert();
   • getBalanceFactor();
   • updateHeight();
   • getHeight();
   • L();
   • R();
3. 所有引起树的结构变化的操作都要传地址，如上述的insert()，L()，R()。