pat 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

判断二叉树是否为完全二叉树：

层序遍历时，记录访问过的结点数目，当该结点没有孩子结点时，结束遍历，若访问过的节点数目不为n时，则不为完全二叉树。

注意：n<20,不是小于10，要把字符转化成数字。

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
#include<vector>
#include<algorithm>
#include<queue>
#define MS(a,b) memset(a,b,sizeof(a))
int last,n,cnt;
vector<int>v;
struct node
{
    int left,right,fa;
}tree[200];
void bfs(int root)
{
    int rt;
    queue<int>q;
    q.push(root);
    while(!q.empty())
    {
      rt=q.front();
      q.pop();
     if(rt!=-1)
     {
        last=rt;//最后一个结点。
        cnt++;//访问过结点的数目。
     }
       if(rt==-1)break;
        q.push(tree[rt].left);
        q.push(tree[rt].right);
    }
}
int main()
{
    /*#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif*/
    int i;
    char s1[5],s2[5];
    scanf("%d",&n);
    for(i=0;i<n;i++)
        tree[i].left=tree[i].right=tree[i].fa=-1;
   for(i=0;i<n;i++)
   {
       cin>>s1>>s2;
       if(s1[0]!='-')
         {  sscanf(s1,"%d",&tree[i].left);//将字符转化为数字。
            tree[tree[i].left].fa=i;
         }
       else tree[i].left=-1;
       if(s2[0]!='-')
         {  sscanf(s2,"%d",&tree[i].right);
            tree[tree[i].right].fa=i;
         }
       else tree[i].right=-1;
   }
   int root=-1;
   for(i=0;i<n;i++)
    if(tree[i].fa==-1)
       {root=i;break;}
       cnt=0;
        bfs(root);
     if(cnt==n)
      printf("YES %d\n",last);
     else  printf("NO %d\n",root);
    return 0;
}