Data Structures | Balanced Binary Search Trees | Question 11

What is the worst case possible height of Red-Black tree?

Assume base of Log as 2 in all options
(A) 2Log(n+1)
(B) 1.44 Logn
(C) 4Logn
(D) None of the above


Answer: (A)

Explanation: Refer Wiki Page of Red-Black Tree

Quiz of this Question



My Personal Notes arrow_drop_up