该博客介绍了一种平衡二叉搜索树——红黑树，并给出了其五个特性。任务是根据给定的二叉搜索树的先序遍历序列判断是否符合红黑树的条件。输入包含多个测试用例，每个用例包括树的节点数和先序遍历序列。输出应为“是”或“否”，表示给定树是否合法的红黑树。
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.
 |
 |
|---|
最低0.47元/天 解锁文章
505
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
