PAT甲级 1135 Is It A Red-Black Tree (30 分) 【红黑树】-CSDN博客

根据红黑树的五条性质，检查给定的二叉搜索树的前序遍历序列是否符合红黑树的要求。输入包含多个测试用例，每个用例给出树的节点数和前序遍历序列，输出是或否表示是否为合法红黑树。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

题目大意：
给一棵二叉搜索树的前序遍历，判断它是否为红黑树，是输出Yes，否则输出No。

代码学习自https://www.liuchuo.net/archives/4099

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
vector<int> a;
struct node {
   
   
    int val;
    struct node *l, *r;
};