PAT Advanced 1110 Complete Binary Tree

1110 Complete Binary Tree

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. 找到根节点，二叉树的性质中根节点不会作为子节点， 图示中的根节点就是6，通过hash的方法找到根节点。
2. 遍历选择dfs，这样方便找对应节点的下标。
3. 判断是否是完全二叉树， 如果是完全二叉树的话节点个数和最后一个节点的下标数相同，如果不是的话，那么最后一个节点的下标数 > 节点数， 因为其中存在不连续的下标值，所以最后一个节点的下标数一定比节点个数的值大。

图示

给定的起始的二叉树如下：

完成构建二叉树：

解题代码

#include <iostream>
using namespace std;
int btree[25][2], a[25];
int n, idx, last;
void dfs(int v, int  cur){
    if (v == -1) return;
    if (idx < cur) idx = cur, last = v;
    dfs(btree[v][0], 2 * cur);
    dfs(btree[v][1], 2 * cur + 1);
}
int main(){
    scanf("%d", &n);
    for(int i = 0; i < n; i++){
        string sl, sr;
        cin >> sl >> sr;
        btree[i][0] = btree[i][1] = -1;
        if (sl != "-") btree[i][0] = stoi(sl), a[stoi(sl)] = 1;
        if (sr != "-") btree[i][1] = stoi(sr), a[stoi(sr)] = 1;
    }
    int root;
    for (int i = 0; i < n; i++) if (!a[i]) root = i;
    dfs(root, 1);
    if (idx == n) printf("YES %d", last);
    else printf("NO %d", root);
    return 0;
}