PAT 1123 Is It a Complete AVL Tree

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.

Sample Input 1:

5
88 70 61 63 65

Sample Output 1:

70 63 88 61 65
YES

Sample Input 2:

8
88 70 61 96 120 90 65 68

Sample Output 2:

88 65 96 61 70 90 120 68
NO

题目大意：构建一颗avl，并且判断是否是完全二叉树， 输出层序遍历；
尝试用了算法笔记上面的方法， 代码的思路更加清晰一些， 构造的时间比以前的方法短一些； 
区别在于，在节点中添加了记录节点高度的变量， 在求节点高度的时候，不用递归的去求高度
         引用传值，也让代码简洁很多；
         在左旋右旋的过程中跟新节点高度；
如何证明二叉树是完全二叉树的方法见：https://www.cnblogs.com/mr-stn/p/9232618.html
注意点：在c++中0被认作是false，其他的值认为是true；

#include<iostream>
#include<vector>
#include<queue>
using namespace std;
struct Node{
  int val, height;
  Node *left, *right;
  Node(int v){
    val = v;
    height = 1;
    left = right = NULL;
  }
};

int getHeight(Node *root){
  return root==NULL ? 0 : root->height;
}

int getBalanceFactor(Node *root){
  int l=getHeight(root->left), r=getHeight(root->right);
  return l-r;
}

void updateHeight(Node *root){
  int l=getHeight(root->left), r=getHeight(root->right);
  root->height =  l>r ? l+1 : r+1;
}

void leftRoate(Node* &root){
  Node *temp = root->right;
  root->right = temp->left;
  temp->left = root;
  updateHeight(root);
  updateHeight(temp);
  root = temp;
}

void rightRoate(Node* &root){
  Node *temp=root->left;
  root->left = temp->right;
  temp->right = root;
  updateHeight(root);
  updateHeight(temp);
  root = temp;
}

void insertNode(Node* &root, int val){
  if(root==NULL){
    root = new Node(val);
    return;
  }
  if(val<root->val){
    insertNode(root->left, val);
    updateHeight(root);
    if(getBalanceFactor(root)==2){
      if(getBalanceFactor(root->left)==1) rightRoate(root);
      else{
        leftRoate(root->left);
        rightRoate(root);
      }
    }
  }else{
    insertNode(root->right, val);
    updateHeight(root);
    if(getBalanceFactor(root)==-2){
      if(getBalanceFactor(root->right)==-1) leftRoate(root);
      else{
        rightRoate(root->right);
        leftRoate(root);
      }
    }
  }
}
int main(){
  int n, i;
  scanf("%d", &n);
  Node *root=NULL;
  for(i=0; i<n; i++){
    int node;
    scanf("%d", &node);
    insertNode(root, node);
  }
  vector<int> level;
  queue<Node*> q;
  q.push(root);
  bool existNullNode=false, isAVL=true;
  while(q.size()){
    Node *temp = q.front();
    q.pop();
    level.push_back(temp->val);
    if(temp->left){
      q.push(temp->left);
      if(existNullNode) isAVL=false;
    }else existNullNode=true;
    if(temp->right){
      q.push(temp->right);
      if(existNullNode) isAVL=false;
    }else existNullNode=true;
  }
  printf("%d", level[0]);
  for(i=1; i<n; i++) printf(" %d", level[i]);
  printf("
%s", isAVL ? "YES" : "NO");
  return 0;
}