完全二叉树判定方法

完全二叉树判定方法

​ 把完全二叉树以数组的形式存储起来，只要结点是连续存放，就可以说明这棵树是完全二叉树。

​ 也就是说，只要最后一个结点的坐标与结点的总数相同，说明这棵树是完全二叉树。

​ 下面给出一道例题：

甲级PAT：1110 Complete Binary Tree (25分)

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 (≤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