Q31
What is the height of a Red-Black tree with n nodes in the worst case?
A.
O(n)
B.
O(log2 n)
C.
O(log n)
AnswerD.
O(1)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board