1110. Complete Binary Tree (25)-PAT甲级真题(静态链表)

题意

判断是否完全二叉树，找根和最后一个叶子，简单题，不赘述。

题解

#include<bits/stdc++.h>
using namespace std;
string l, r;
int n, root, findr[21], lc[21], rc[21], cnt, t;
int main(){
	cin>>n;
	for(int i = 0; i < n; i ++){
		cin>>l>>r;
		if(l != "-"){
			lc[i] = stoi(l);
			findr[stoi(l)] = -1;
		}else lc[i] = -1;
		if(r != "-"){
			rc[i] = stoi(r);
			findr[stoi(r)] = -1;
		}else rc[i] = -1;
	}
	for(int i = 0; i < n; i ++)
		if(findr[i] != -1) root = i;
	queue<int> que;
	que.push(root);
	while(que.size()){
		t = que.front();
		que.pop();
		cnt++;
		if(lc[t] != -1) que.push(lc[t]);
		else break;
		if(rc[t] != -1) que.push(rc[t]);
		else break;
	}
	cnt + que.size() == n ? printf("YES %d", que.back()) : printf("NO %d", root);
	return 0;
}

原题

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