pat 1123 判断完全二叉平衡树

题目描述：

1123. Is It a Complete AVL Tree (30)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Figures 1-4 illustrate the rotation rules.

    

    

Now given a sequence of insertions, you are supposed to output the level-order traversal sequence of the resulting AVL tree, and to tell if it is a complete binary tree.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (<= 20). Then N distinct integer keys are given in the next line. All the numbers in a line are separated by a space.

Output Specification:

For each test case, insert the keys one by one into an initially empty AVL tree. Then first print in a line the level-order traversal sequence of the resulting AVL tree. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line. Then in the next line, print "YES" if the tree is complete, or "NO" if not.

纪念一下完成这道题目，参考了网上的一些内容。

#include<iostream>
#include<algorithm>
#include<memory.h>
using namespace std;
struct tree{
    int data;
    tree*left;
    tree*right;
};
int getheight(tree *t){
    if(t==NULL)
        return 0;
    return max(getheight(t->left),getheight(t->right))+1;
}
tree *Lrotate(tree *t){
    tree *tmp=t->right;
    t->right=tmp->left;
    tmp->left=t;
    return tmp;
}
tree *Rrotate(tree *t){
    tree *tmp=t->left;
    t->left=tmp->right;
    tmp->right=t;
    return tmp;
}
tree *insert(tree *&root,int data){
    if(root==NULL){
        root=new tree();
        root->data=data;
        root->left=root->right=NULL;
    }
    else if(data<root->data){
        root->left=insert(root->left,data);
        if(getheight(root->left)-getheight(root->right)==2){
            if(getheight(root->left->left)-getheight(root->left->right)==1)
                root=Rrotate(root);
            else{
                root->left=Lrotate(root->left);
                root=Rrotate(root);
            }
        }
    }
    else{
        root->right=insert(root->right,data);
        if(getheight(root->right)-getheight(root->left)==2){
            if(getheight(root->right->right)-getheight(root->right->left)==1)
                root=Lrotate(root);
            else{
                root->right=Rrotate(root->right);
                root=Lrotate(root);
            }
        }
    }
    return root;
}
int level[300];
void levelorder(tree *root,int index){
    if(root==NULL)
        return;
    level[index]=root->data;
    levelorder(root->left,index*2+1);
    levelorder(root->right,index*2+2);
}
int main(){
    int N;
    cin>>N;
    memset(level,-1,sizeof(level));
    tree *root=NULL;
    for(int i=0;i<N;i++){
        int data;
        cin>>data;
        insert(root, data);
    }
    levelorder(root,0);
    int cnt=0,num=0;
    for(int i=0;i<300;i++){
        if(level[i]==-1)
            break;
        cnt++;
    }
    for(int i=0;i<300;i++){
        if(level[i]!=-1){
            num==N-1?cout<<level[i]<<endl:cout<<level[i]<<" ";
            num++;
        }
    }
    cnt==N?cout<<"YES":cout<<"NO";
    return 0;
}