PAT（甲级）1110 Complete Binary Tree (25 分) 经验分享与心路历程

无计时训练，得21分

// 1110 Complete Binary Tree (25 分).cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//

#include <bits/stdc++.h>
using namespace std;

struct node {
    int val;
    node* left;
    node* right;
    int level;
    node() {
        left = right = NULL;
    }
};
int max_level = -1;
vector<node> tree;
unordered_map<int, bool> parent;
vector<node> level;

void BFS(node* root) {
    queue<node*> q;
    root->level = 1;
    q.push(root);
    while (!q.empty()) {
        node* first = q.front();
        if (first->level > max_level) {
            max_level = first->level;
        }
        level.push_back(*first);
        q.pop();
        if (first->left != NULL) {
            first->left->level = first->level + 1;
            q.push(first->left);
        }
        if (first->right != NULL) {
            first->right->level = first->level + 1;
            q.push(first->right);
        }
    }
}

int main()
{
#ifndef ONLINE_JUDGE
    FILE* s;
    freopen_s(&s, "in.txt", "r", stdin);
#endif // !ONLINE_JUDGE

    int n;
    cin >> n;
    string lc, rc;
    tree.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> lc >> rc;
        tree[i].val = i;
        if (lc != "-") {
            tree[i].left = &tree[stoi(lc)];
            parent[stoi(lc)] = true;
        }
        if (rc != "-") {
            tree[i].right = &tree[stoi(rc)];
            parent[stoi(rc)] = true;
        }       
    }
    int root;
    for (int i = 0; i < n; i++) {
        if (parent[i] != true) {
            root = i;
            break;
        }
    }
    node* root1 = &tree[root];
    BFS(root1);
    
    //先计算一层内节点的数量，总共最大的层数是多少,前面已经获取了，运行到之前的层数
    //最后一层不需要进行考虑，前面的层数必须满足，如果不满足的话直接报错就可以了
    unordered_map<int, int> count;//level how many
    for (int i = 0; i < level.size(); i++) {
        //首先计算level相同的节点的数量
        count[level[i].level]++;
    }
    bool flag = true;
    int cur_level = 1;
    for (int cur_level = 1; cur_level < max_level; cur_level++) {
        if (count[cur_level] != (int)pow(2, cur_level - 1)) {
            flag = false;
            break;
        }
    }
    if (flag) {
        cout <<"YES"<<" "<<level[level.size() - 1].val<<endl;
    }
    else {
        cout << "NO" << " " << root << endl;
    }
    return 0;
}