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
)
N (≤20)
N(≤20) which is the total number of nodes in the tree – and hence the nodes are numbered from 0 to
N
−
1
N−1
N−1. Then
N
N
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 2
Solution:
// Talk is cheap, show me the code
// Created by Misdirection 2021-08-24 23:04:09
// All rights reserved.
#include <iostream>
#include <vector>
#include <unordered_map>
#include <queue>
using namespace std;
vector<pair<int, int>> input;
struct Node{
int key;
int levelOrder;
Node *left;
Node *right;
Node(int k = -1){
key = k;
levelOrder = -1;
left = NULL;
right = NULL;
}
~Node(){}
};
void findChildren(Node *r){
if(r -> key == -1) return;
r -> left = new Node(input[r -> key].first);
r -> right = new Node(input[r -> key].second);
findChildren(r -> left);
findChildren(r -> right);
}
int main(){
int n;
scanf("%d", &n);
input.clear();
unordered_map<int, int> flag;
for(int i = 0; i < n; ++i){
string a, b;
cin >> a >> b;
int left, right;
if(a == "-") left = -1;
else left = stoi(a);
if(b == "-") right = -1;
else right = stoi(b);
input.emplace_back(left, right);
flag[left] = flag[right] = 1;
}
int r;
for(int i = 0; i < n; ++i){
if(flag[i] != 1){
r = i;
break;
}
}
Node *root = new Node(r);
findChildren(root);
queue<Node*> q;
q.push(root);
int lastNode = root -> key;
int cnt = 0;
bool isCBT = true;
while(true){
if(q.front() -> key == -1){
if(cnt != n) isCBT = false;
break;
}
else{
lastNode = q.front() -> key;
q.push(q.front() -> left);
q.push(q.front() -> right);
cnt++;
q.pop();
}
}
if(isCBT == false) printf("NO %d\n", root -> key);
else printf("YES %d\n", lastNode);
return 0;
}