Open In App
Related Articles

Data Structures | Balanced Binary Search Trees | Question 11

Improve Article
Save Article
Like Article

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

Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated : 28 Jun, 2021
Like Article
Save Article
Similar Reads
Complete Tutorials