1135 Is It A Red-Black Tree (30 分) 红黑树

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.

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

1.根据先序遍历先建立一棵树，用链表表示
2.判断根节点是否是黑色
3.根据建立的树，从根节点开始遍历，如果当前节点是红色，判断它的孩子节点是否为黑色，递归返回结果
4.从根节点开始遍历，检查每个节点的左右子树的黑色子节点的个数是否相同，递归返回结果

#include<bits/stdc++.h>
using namespace std;
struct node{
	int val;
	struct node *left, *right;
};
node* CreateTree(node* root, int val) {
	if (root == nullptr) {
		root = (node*)malloc(sizeof(node));
		root->left = root->right = nullptr;
		root->val = val;
	} else {
		if (abs(val) > abs(root->val)) {
			root->right = CreateTree(root->right, val);
		} else if (abs(val) < abs(root->val)) {
			root->left = CreateTree(root->left, val);
		}
	}
	return root;
}
bool judge1(node* root) {
	if (root == nullptr) return true;
	if (root->val < 0) {
		if (root->left != nullptr && root->left->val < 0) return false;
		if (root->right != nullptr && root->right->val < 0) return false;
	}
	return judge1(root->left) && judge1(root->right);
}
int getNum(node* root) {
	if (root == nullptr) return 0;
	int l = getNum(root->left);
	int r = getNum(root->right);
	return root->val > 0 ? max(l, r) + 1 : max(l, r);
}
bool judge2(node* root) {
	if (root == nullptr) 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() {
	int k;
	scanf("%d", &k);
	for (int i = 0; i < k; i++) {
		int n;
		scanf("%d", &n);
		vector<int> arr(n);
		node *root = nullptr;
		for (int i = 0; i < n; i++) {
			scanf("%d", &arr[i]);
			root = CreateTree(root, arr[i]);
		}
		if (root->val < 0 || judge1(root) == false || judge2(root) == false) printf("No\n");
		else printf("Yes\n");
	}
}