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
(B) 1.44 Logn
(D) None of the above
Explanation: Refer Wiki Page of Red-Black Tree
Quiz of this Question
My Personal Notes arrow_drop_up
Please Login to comment...