答案及解析：[单选题]Wich property could be violated after removing a node in a red-black tree using the algorithm for BS

问题：

[单选题]Wich property could be violated after removing a node in a red-black tree using the algorithm for BST node removal?
在红黑树中直接按照常规的BST删除节点算法删除一个节点，关于红黑树结构的四条性质是否有可能被破坏？

1、the root is balck 树根必为黑色
A could be violated 有可能会被破坏
Bwon't be violated 不会被破坏

2、the external nodes are black 外部节点必均为黑色

Acould be violated 有可能会被破坏

B won't be violated 不会被破坏

3、the children of a red node are black 红色节点的孩子必为黑

Acould be violated 有可能会被破坏

B won't be violated 不会被破坏

4、there are equal number of black nodes in each path from a external node to the root
从根到外部节点的不同路径途中黑色节点数目相等

A could be violated 有可能会被破坏

Bwon't be violated 不会被破坏

Tags：学堂在线清华大学数据结构(下)(2021春)课后作业题答案

答案解析：

╋纠错

您可能感兴趣的问题