1135. Is It A Red-Black Tree (30)-PAT甲级真题 (RBT 构造树)

题意

给几棵树，判断是否是红黑树。

思路

• 构造。
• DFS遍历，根据根叶黑、不红红、黑路同的性质否定红黑树。希望今年夏天把这道作为最后一题考(*^▽^*)

题解

#include<bits/stdc++.h>
using namespace std;
int k, n, mcnt, f, tmp;
int dat[31], col[31];// 1 - black, 0 - red;
struct node{
	int dat;
	node* l,* r;
	bool col;
};
node* mt(int l, int r){
	if(l > r) return NULL;
	node* t = (node*)malloc(sizeof(node));
	int i = l + 1;
	while(i <= r && dat[i] < dat[l]) i++;
	t->dat = dat[l];
	t->l = mt(l + 1, i - 1);
	t->r = mt(i, r);
	t->col = col[l];
	return t;
}
void DFS(node* t, int cnt){
	if(t->l){
		if(!t->col && !t->l->col) f = 0;
		if(t->l->col)DFS(t->l, cnt + 1);
		else DFS(t->l, cnt);
	}else{
		if(mcnt == 0) mcnt = cnt;
		else if(mcnt != cnt) f = 0;
	}
	if(t->r){
		if(!t->col && !t->r->col) f = 0;
		if(t->r->col) DFS(t->r, cnt + 1);
		else DFS(t->r, cnt);
	}else{
		if(mcnt == 0) mcnt = cnt;
		else if(mcnt != cnt) f = 0;
	}
}
int main(){
	cin>>k;
	while(k--){
		cin>>n;
		for(int i = 0; i < n; i ++){
			cin>>tmp;
			dat[i] = abs(tmp);
			col[i] = tmp > 0 ? 1 : 0;
		}
		node * t = mt(0, n - 1);
		f = 1, mcnt = 0;
		if(!t->col) f = 0;
		DFS(t, 1);
		puts(f ? "Yes" : "No");
	}
}

题目

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