PAT真题练习（甲级）1110 Complete Binary Tree (25 分)

PAT真题练习（甲级）1110 Complete Binary Tree (25 分)

原题网址：https://pintia.cn/problem-sets/994805342720868352/problems/994805359372255232

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 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. 定义Node结构，用于表示每个节点，读取过程中，注意同时设置parent属性值
2. 遍历所有节点，找到没有parent的节点，即为根节点
3. 构建一个数组来表示这个树（即下标为index的节点，他的左子下标为index* 2，右子下标为index* 2 + 1）
4. 若构建过程中，访问到的节点下标 > N+ 1，则证明这不是完全二叉树

注意： 表示根节点的下标要从1开始！

AC代码

#include <stdio.h>
#include <iostream>
#include <stack>
#include <vector>