1135. Is It A Red-Black Tree (30)
时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B
判题程序 Standard 作者 CHEN, Yue
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
注意点:不用判断平衡,因为后者说的是 each given binary search tree ,没有平衡,直接建树就好
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
typedef struct tnode {
int data;
bool isRed;
struct tnode * lchild, *rchild;
tnode() { isRed = false; lchild = rchild = nullptr; }
}TNode,*PTNode;
using namespace std;
void InsertBT(PTNode & root, int data) {
if (!root) {
root = new TNode;
root->data = abs(data);
root->isRed = (data < 0);
}
else if (root->data > abs(data)) InsertBT(root->lchild, data);
else if (root->data < abs(data)) InsertBT(root->rchild, data);
}
void DFS(PTNode root, bool& r_b ,int& black_n,int now_b_n) {
if (!root) {
if (black_n == -1) black_n = now_b_n;
else if (black_n != now_b_n) r_b = false;
return;
}
if (r_b) {
if (root->isRed) {
if (root->lchild && root->lchild->isRed == true || root->rchild && root->rchild->isRed == true) {
r_b = false;
return;
}
}
bool tmp = (root->lchild != nullptr) ? (!(root->lchild->isRed)) : 0;
DFS(root->lchild, r_b, black_n, now_b_n + tmp);
tmp = (root->rchild != nullptr) ? (!(root->rchild->isRed)) : 0;
DFS(root->rchild, r_b, black_n, now_b_n + tmp);
}
}
int main() {
#ifdef _DEBUG
freopen("data.txt", "r+", stdin);
#endif // _DEBUG
std::ios::sync_with_stdio(false);
int n; cin >> n;
while (n--) {
int noden; cin >> noden;
PTNode root = nullptr;
while (noden--) {
int data; cin >> data;
InsertBT(root, data);
}
if (root->isRed) cout << "No\n";
else {
bool r_b = true; int black_n = -1, now_b_n = 0;
DFS(root, r_b, black_n, now_b_n);
r_b ? (cout << "Yes\n") : (cout << "No\n");
}
}
return 0;
}