原题链接
#include<algorithm>
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cstring>
#include <ctime>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
typedef struct BiTNode
{
int data;
bool isRoot;
struct BiTNode *lChild, *rChild;
}BiTNode, *BiTree;
const int MAX = 50;
BiTree P[MAX];
bool isComplete(BiTree ROOT, BiTree &LAST)
{
queue<BiTree> Q;
BiTree T = ROOT;
Q.push(T);
int flag = 0;
while(!Q.empty())
{
T = Q.front();
LAST = T;
Q.pop();
if(T->lChild)
{
Q.push(T->lChild);
if(flag) return false;
}
else flag = 1;
if(T->rChild)
{
Q.push(T->rChild);
if(flag) return false;
}
else flag = 1;
}
return true;
}
int main()
{
int N;
scanf("%d", &N);
for(int i=0; i<N; i++)
{
P[i] = new BiTNode;
P[i]->isRoot = 1;
}
for(int i=0; i<N; i++)
{
char str1[5], str2[5];
scanf("%s %s", str1, str2);
P[i]->data = i;
if(!strcmp(str1, "-")) P[i]->lChild = NULL;
else
{
int num = 0;
sscanf(str1, "%d", &num);
P[i]->lChild = P[num];
P[num]->isRoot = 0;
}
if(!strcmp(str2, "-")) P[i]->rChild = NULL;
else
{
int num = 0;
sscanf(str2, "%d", &num);
P[i]->rChild = P[num];
P[num]->isRoot = 0;
}
}
int T = 0;
while(T < N && !P[T]->isRoot) T++;
BiTree ROOT = P[T], LAST = ROOT;
if(isComplete(ROOT, LAST)) printf("YES %d\n", LAST->data);
else printf("NO %d\n", ROOT->data);
return 0;
}