A1123 Is It a Complete AVL Tree （30 分）

#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
int n;
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;
	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)
	{
		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//LR型
			{
				L(root->lchild);
				R(root);
			}
		}
	}
	else//插入右子树
	{
		insert(root->rchild,v);
		updateheight(root);
		if(getbalancefactor(root)==-2)//平衡因子为-2
		{
			if (getbalancefactor(root->rchild) == 1)//RL型
			{
				R(root->rchild);
				L(root);
			}
			else//RR型
			{
				L(root);
			}
		}
	}
}
int total = 0;
void levelorder(node* root)
{
	queue<node*> q;
	q.push(root);
	while (!q.empty())
	{
		node* now = q.front();
		q.pop();
		total++;
		printf("%d", now->v);
		if (total != n) printf(" ");
		if (now->lchild != NULL)
		{
			q.push(now->lchild);
		}
		if (now->rchild != NULL)
		{
			q.push(now->rchild);
		}
	}
}
int maxindex = 0;
void preorder(node* root, int index)
{
	if (root == NULL) return;
	if (index > maxindex) maxindex = index;
	preorder(root->lchild, index * 2);
	preorder(root->rchild, index * 2 + 1);
}
int main()
{
	int temp;
	scanf("%d", &n);
	node* root = NULL;
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &temp);
		insert(root, temp);
	}
	levelorder(root);
	printf("\n");
	preorder(root,1);
	if (maxindex == n) printf("YES");
	else printf("NO");
	return 0;
}

感觉像是几道题目的拼凑。。。