1135 Is It A Red-Black Tree

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

AC代码

#include <cstdio>
#include <iostream>
#include <set> 
using namespace std;

typedef struct node{
	int data; 
	node *lchild, *rchild;
}*BTree; 	

void insert(BTree &BT, int v){
	if(BT == NULL){
		BT = new node;
		BT->lchild = BT->rchild = NULL;
		BT->data = v;
		return;
	}else{
		if(abs(BT->data) >= abs(v))
			insert(BT->lchild, v);
		else insert(BT->rchild, v);
	}
}

set<int> s;
void getNum(BTree &BT, int cnt){
	//获得每个结点到后代叶结点路径中的黑色结点数量 
	if(BT == NULL){
		s.insert(cnt);
		return;
	} 
	int t = BT->data < 0 ? 0 : 1;
	getNum(BT->lchild, cnt + t);
	getNum(BT->rchild, cnt + t);
}

bool judge(BTree &BT){
	//判断该树是否满足第4个条件 
	if(BT == NULL) return true;
	if(BT->data < 0){
		if(BT->lchild != NULL && BT->lchild->data < 0) return false;
		if(BT->rchild != NULL && BT->rchild->data < 0) return false;
	}
	return judge(BT->lchild) && judge(BT->rchild);
}

int main(){ 	
	int k, n, data;
	cin>>k;
	for(int i = 0; i < k; i++){
		cin>>n;
		s.clear();
		BTree BT = NULL;
		bool flag = true;
		for(int j = 0; j < n; j++){
			cin>>data;
			insert(BT, data);
		}
		if(BT->data < 0) flag = false; //条件2 
		else{
			getNum(BT, 0);
			if(s.size() != 1) flag = false; //条件5
			else flag = judge(BT); //条件4 
		}
		if(flag) cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
	return 0;
}