【完全二叉树规律】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
结尾无空行

Code

#include <iostream>
using namespace std;
struct node{
	int left;
	int right;
}a[1000];
int maxn = -1, ans;
void dfs(int root, int index){
	if(index > maxn){
		maxn = index;
		ans = root;//这是最后一次遍历到的位置会进去的 
	}
	if(a[root].left != -1)	dfs(a[root].left, index * 2);
	if(a[root].right != -1) dfs(a[root].right, index * 2 + 1);
}
int main(){
	int n;//number from i to n -1
	cin>>n;
	bool isChild[600];
	for(int i = 0; i < n; i++){
		string l, r;
		cin>>l>>r;
		if(l == "-"){
			a[i].left = -1;
		}else{
			a[i].left = stoi(l);
			isChild[a[i].left] = true;
		}
		if(r == "-"){
			a[i].right = -1;
		}else{
			a[i].right = stoi(r);
			isChild[a[i].right] = true;
		}
	}
	int i;
	for(i = 0; isChild[i] == true;)
		i++;
	int root = i;
	dfs(root, 1);
	if(maxn == n)
		cout<<"YES "<<ans;
	else
		cout<<"NO "<<root;
	
}

Summary

如果是完全二叉树的话，根的左右和下标关系是有关系的，left = 2 * root ，right = 2 * root + 1,所以可以遍历最大的下标，最大下标 = 总的节点数（完全二叉树），如果最大下标 >结点数就不是了