【PAT】1123. Is It a Complete AVL Tree

考查点：AVL，判断完全树，BFS

思路：直接用AVL相关操作建树，判断完全树可以用开个数组记录编号如果数组不连续说明不是完全树

#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define FOR(i, x, y) for(int i = x; i <  y; i++)
#define rFOR(i, x, y) for(int i = x; i > = y; i--)
#define MAXN 110
#define oo 0x3f3f3f3f
using namespace std;
int data[MAXN];
int a[MAXN];
struct node{
    int v,height;
    node *lchild,*rchild;
};
int n;
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 searchAVL(node* root,int x)
{
    if(root==NULL) {
        printf("search failed\n");
        return;
    }
    if(x==root->v){
        printf("%d\n",root->v);
    }else if(x<root->v) searchAVL(root->lchild,x);
    else searchAVL(root->rchild,x);
}

void LR(node* &root)
{
    node* temp=root->rchild;
    root->rchild=temp->lchild;
    temp->lchild=root;
    updateHeight(root);
    updateHeight(temp);
    root=temp;
}

void RR(node* &root)
{
    node* temp=root->lchild;
    root->lchild=temp->rchild;
    temp->rchild=root;
    updateHeight(root);
    updateHeight(temp);
    root=temp;
}
void insertAVL(node* &root,int v)
{
    if(root==NULL){
        root=newNode(v);
        return;
    }
    if(v<root->v){
        insertAVL(root->lchild,v);
        updateHeight(root);
        if(getBalanceFactor(root)==2){
            if(getBalanceFactor(root->lchild)==1){
                RR(root);
            }else if(getBalanceFactor(root->lchild)==-1){
                LR(root->lchild);
                RR(root);
            }
        }
    }else{
        insertAVL(root->rchild,v);
        updateHeight(root);
        if(getBalanceFactor(root)==-2){
            if(getBalanceFactor(root->rchild)==-1){
                LR(root);
            }else if(getBalanceFactor(root->rchild)==1){
                RR(root->rchild);
                LR(root);
            }
        }
    }
}
node* Create(int data[],int n)
{
    node* root=NULL;
    FOR(i,0,n)
    {
        insertAVL(root,data[i]);
    }
    return root;
}
int num;
void BFS(node* root)
{
    queue<node*> q;
    q.push(root);
    while(!q.empty()){
        node* t=q.front();
        printf("%d",t->v);
        if(num<n-1) printf(" ");
        else printf("\n");
        num++;
        q.pop();
        if(t->lchild!=NULL) q.push(t->lchild);
        if(t->rchild!=NULL) q.push(t->rchild);
    }
}
void preOrder(node* root,int index)
{
    if(root==NULL) return;
    data[index]=index;
    preOrder(root->lchild,index*2);
    preOrder(root->rchild,index*2+1);
}

int main()
{
    #ifdef LOCAL
        freopen("data.in","r",stdin);
        freopen("data.out","w",stdout);
    #endif // LOCAL

    scanf("%d",&n);
    FOR(i,0,n)
    {
        scanf("%d",&a[i]);
    }
    node* root=Create(a,n);
    BFS(root);
    preOrder(root,1);
    int flag=0;
    FOR(i,1,n+1)
    {
        if(data[i]==0){
            flag=1;printf("NO");break;
        }
    }
    if(flag==0)printf("YES");
    return 0;
}