1110 Complete Binary Tree (25 分)

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<bits/stdc++.h>
using namespace std;
struct node {
	int l, r;
} data[25];
int n, maxindex = -1, ans;
void dfs(int root, int index) {
	if (index > maxindex) {
		maxindex = index;
		ans = root;
	}
	if (data[root].l != -1) dfs(data[root].l, index * 2);
	if (data[root].r != -1) dfs(data[root].r, index * 2 + 1);
}
int main() {
	scanf("%d", &n);
	int have[25], root;
	string a, b;
	for (int i = 0; i < n; i++) {
		cin >> a >> b;
		if (a == "-") {
			data[i].l = -1;
		} else {
			data[i].l = stoi(a);
			have[data[i].l] = 1;
		}
		if (b == "-") {
			data[i].r = -1;
		} else {
			data[i].r = stoi(b);
			have[data[i].r] = 1;
		}
	}
	for (int i = 0; i < n; i++) {
		if (have[i] == 0) {
			root = i;
			break;
		}
	}
	dfs(root, 1);
	if (maxindex == n) {
		printf("YES %d", ans);
	} else printf("NO %d", root);
}