問題詳情
20. In a red-black tree of size n
(A) The root is always black.
(B) Each node is colored red or black.
(C) No root-to-external-node path has two consecutive red nodes.
(D)All root-to-external-node path have the same number of black nodes.
(E) The height of is O(logn).
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增