PAT|1110 Complete Binary Tree (完全二叉树、遍历)

题目大意

给定一棵树，你应该判断它是否是一棵完整的二叉树。

解题思路

• 首先根据输入创建二叉树
• 没有涉及到的节点就是根节点
• 深度优先，遍历、
• 根据满二叉树节点之间index的性质判断即可

代码

#include<bits/stdc++.h>
using namespace std;
int n, root, maxid = -1, ans;

struct node
{
	int val;
	int left;
	int right;

};
int trans(string str) {
	int size = str.size();
	int ans = 0;
	for (int i = 0; i < size; i++) {
		ans += (str[i] - '0') * pow(10, size - i - 1);
	}
	return ans;
}
vector<node> tree;
void dfs(int root, int index) {
	if (index > maxid) {
		maxid = index;
		ans = root;
	}

	if (tree[root].left != -1) {
		dfs(tree[root].left, (index + 1) * 2 - 1);
	}
	if (tree[root].right != -1) {
		dfs(tree[root].right, (index + 1) * 2);
	}
}
int main() {
	cin >> n;
	tree.resize(n);
	vector<int> rescod(n,0);
	
	for (int i = 0; i < n; i++) {
		string s1, s2;
		cin >> s1 >> s2;
		if (s1 == "-") {
			tree[i].left = -1;
		}
		else {
			tree[i].left = trans(s1);
			rescod[tree[i].left] = 1;
		}
		if (s2 == "-") {
			tree[i].right = -1;
		}
		else {
			tree[i].right = trans(s2);
			rescod[tree[i].right] = 1;
		}
	}

	//得到根结点----从没有出现过的节点
	for (int i = 0; i < n; i++) {
		if (rescod[i] == 0) {
			root = i;
			break;;
		}
	}

	//判断是否为完全二叉树---根据下标判断
	dfs(root, 0);
	if (maxid == n-1) {
		cout << "YES " << ans;
	}
	else {
		cout << "NO " << root;
	}

	return 0;
}