1135 Is It A Red-Black Tree （30 分）

There is a kind of balanced binary search tree named red-black tree in the data structure. It has the following 5 properties:

• (1) Every node is either red or black.
• (2) The root is black.
• (3) Every leaf (NULL) is black.
• (4) If a node is red, then both its children are black.
• (5) For each node, all simple paths from the node to descendant leaves contain the same number of black nodes.

For example, the tree in Figure 1 is a red-black tree, while the ones in Figure 2 and 3 are not.

Figure 1	Figure 2	Figure 3

For each given binary search tree, you are supposed to tell if it is a legal red-black tree.

Input Specification:

Each input file contains several test cases. The first line gives a positive integer K (≤30) which is the total number of cases. For each case, the first line gives a positive integer N (≤30), the total number of nodes in the binary tree. The second line gives the preorder traversal sequence of the tree. While all the keys in a tree are positive integers, we use negative signs to represent red nodes. All the numbers in a line are separated by a space. The sample input cases correspond to the trees shown in Figure 1, 2 and 3.

Output Specification:

For each test case, print in a line "Yes" if the given tree is a red-black tree, or "No" if not.

Sample Input:

3
9
7 -2 1 5 -4 -11 8 14 -15
9
11 -2 1 -7 5 -4 8 14 -15
8
10 -7 5 -6 8 15 -11 17

Sample Output:

Yes
No
No

---

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
using namespace std;
struct Node {
	int val;
	Node *left, *right;
};
int k;
Node *buildtree(int x, Node *tree) {
	if (tree == NULL) {
		tree = new Node();
		tree->val = x;
	}
	else if (abs(x) < abs(tree->val))
		tree->left = buildtree(x, tree->left);
	else if (abs(x) > abs(tree->val))
		tree->right = buildtree(x, tree->right);
	return tree;
}
int getnum(Node *tree) {
	if (tree == NULL) return 0;
	int l = getnum(tree->left);
	int r = getnum(tree->right);
	return tree->val > 0 ? max(l, r) + 1 : max(l, r);
}
bool judge1(Node *root) {
	if (root == NULL) return true;
	if (root->val < 0) {
		if (root->left != NULL && root->left->val < 0) return false;
		if (root->right != NULL && root->right->val < 0) return false;
	}
	return judge1(root->left) && judge1(root->right);
}
bool judge2(Node *root) {
	if (root == NULL) return true;
	int l = getnum(root->left);
	int r = getnum(root->right);
	if (l != r) return false;
	return judge2(root->left) && judge2(root->right);
}
int main() {
	cin >> k;
	for (int i = 0; i < k; i++) {
		int n;
		cin >> n;
		Node *tree = NULL;
		for (int j = 0; j < n; j++) {
			int t1;
			cin >> t1;
			tree = buildtree(t1, tree);
		}
		if (tree->val < 0) printf("No\n");
		else {
			if (judge1(tree) && judge2(tree)) printf("Yes\n");
			else printf("No\n");
		}
	}
	return 0;
}