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

#include <iostream>
#include <queue>
#include <vector>
#include <string>
#include <cstring>
#include <cstdlib>
using namespace std;
int judge[22],line[22],key=0,N,arr[22][2],root;
void build(int num,int pos)
{
    if(pos<=N)
    {
        line[pos]=num;
        if(arr[num][0]!=-1)
        build(arr[num][0],pos<<1);
        if(arr[num][1]!=-1)
        build(arr[num][1],(pos<<1)+1);
    }
    else
    {
        key=1;
        return;
    }

}
int main()
{
    scanf("%d",&N);
    memset(arr,-1,sizeof(arr));
    for(int i=0;i<N;i++)    
    {
        string tmp;
        cin>>tmp;
        if(tmp[0]!='-')
        arr[i][0]=atoi(tmp.c_str());
        cin>>tmp;
        if(tmp[0]!='-')
        arr[i][1]=atoi(tmp.c_str());
    }
    for(int i=0;i<N;i++)
    {
        if(arr[i][1]!=-1)
        judge[arr[i][1]]=1;
        if(arr[i][0]!=-1)
        judge[arr[i][0]]=1;
    }
    for(int i=0;i<N;i++)
    if(!judge[i])root=i;
    build(root,1);
    if(!key)
    cout<<"YES"<<" "<<line[N];
    else
    cout<<"NO"<<" "<<root;
    return 0;
}