PAT甲1123-AVL树

AVL树的插入操作，之后的LL,RR,LR,RL旋转。

#include <bits/stdc++.h>

using namespace std;

struct node{
	int v;
	node *left, *right;
};



node * leftRotate(node *tree){
	node *temp = tree -> right;
	tree -> right = temp -> left;
	temp -> left = tree;
	return temp; 
}

node *rightRotate(node *tree){
	node *temp = tree -> left;
	tree -> left = temp -> right;
	temp -> right = tree;
	return temp;
}

node *leftRightRotate(node *tree){
	tree -> left = leftRotate(tree -> left);
	return rightRotate(tree);
}

node *rightLeftRotate(node *tree){
	tree -> right = rightRotate(tree -> right);
	return leftRotate(tree);
}


int getHeight(node *tree){
	if(tree == NULL) return 0;
	int l = getHeight(tree -> left);
	int r = getHeight(tree -> right);
	return max(l,r) + 1;
}


node * insert(node *tree, int v){
	if(tree == NULL){
		tree = new node();
		tree -> v = v;
	}else if(tree -> v > v){
		tree -> left = insert(tree -> left, v);
		int l = getHeight(tree -> left), r = getHeight(tree -> right);
		if(l - r >= 2){
			if(v < tree -> left -> v){
				tree = rightRotate(tree);
			}else{
				tree = leftRightRotate(tree);
			}
		}
	}else{
		tree -> right = insert(tree -> right, v);
		int l = getHeight(tree -> left), r = getHeight(tree -> right);
		if( r - l >= 2){
			if(v > tree -> right -> v){
				tree = leftRotate(tree);
			}else{
				tree = rightLeftRotate(tree);
			}
		}
	}
	return tree;
}

int isComplete = 1, after = 0;

vector<int>levelOrder(node *tree){
	vector<int>v;
	queue<node *> q;
	q.push(tree);
	while(!q.empty()){
		node *t = q.front();
		q.pop();
		v.push_back(t -> v);
		if(t -> left != NULL){
			if(after) isComplete = 0;
			q.push(t -> left); 
		}else{
			after = 1;
		}
		if(t -> right != NULL){
			if(after) isComplete = 0;
			q.push(t -> right);
		}else{
			after = 1;
		}
	}
	
	return v;
}



int main(){
	int n,temp;
	scanf("%d", &n);
	node *tree = NULL;
	for(int i = 0; i < n; i++){
		scanf("%d", &temp);
		tree = insert(tree, temp);
	}
	vector<int> v = levelOrder(tree);
	for(int i = 0; i < v.size(); i++){
		if(i != 0) printf(" ");
		printf("%d", v[i]);
	}
	printf("\n%s", isComplete? "YES": "NO");
	
	return 0;
} 

/*
5
88 70 61 63 65
*/


/*
8
88 70 61 96 120 90 65 68
*/

参考了以下2篇博客
https://blog.csdn.net/liuchuo/article/details/53561924
https://blog.csdn.net/qq_25343557/article/details/89110319