1110 Complete Binary Tree (25分)

题目

Given a tree, you are supposed to tell if it is a complete binary tree.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer $N(\le 20)$ which is the total number of nodes in the tree – and hence the nodes are numbered from 0 to $N-1$. Then $N$ lines follow, each corresponds to a node, and gives the indices of the left and right children of the node. If the child does not exist, a - will be put at the position. Any pair of children are separated by a space.

Output Specification:

For each case, print in one line YES and the index of the last node if the tree is a complete binary tree, or NO and the index of the root if not. There must be exactly one space separating the word and the number.

Sample Input 1:

9
7 8
- -
- -
- -
0 1
2 3
4 5
- -
- -

Sample Output 1:

YES 8

##Sample Input 2:

8
- -
4 5
0 6
- -
2 3
- 7
- -
- -

Sample Output 2:

NO 1

题目大意

判断一个二叉树是否是完全二叉树。

思路

利用完全二叉树的性质，即我们对根节点节点进行编号1，左子树标号2，右子树编号3，所有子树都按这个方法编号，那么层次遍历的结果就是连续的1~N，就说明二叉树是完全二叉树，否则不是。

代码

#include <iostream>
#