A1066 Root of AVL Tree （25 分）平衡二叉树

#include<cstdio>
#include<algorithm>
using namespace std;
struct node
{
	int v, height;
	node *lchild, *rchild;
};
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;
}
int getbalancefactor(node* root)
{
	return getheight(root->lchild) - getheight(root->rchild);
}
void updateheight(node* root)
{
	root->height = max(getheight(root->lchild), getheight(root->rchild)) + 1;
}
//左旋
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)//LL型
				R(root);
			else if (getbalancefactor(root->lchild) == -1)//LR型
			{
				L(root->lchild);
				R(root);
			}
		}
	}
	else
	{
		insert(root->rchild, v);
		updateheight(root);
		if (getbalancefactor(root) == -2)
		{
			if (getbalancefactor(root->rchild) == -1)//RR型
				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()
{
	node* root=NULL;
	int n,temp;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &temp);
		insert(root, temp);
	}
	printf("%d", root->v);
	return 0;
}

左旋右旋条件还是不熟