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

Article Tags :

Data Structures

DSA

Balanced Binary Search Trees

Data Structures

Data Structures-Balanced Binary Search Trees

Recommended Articles

1. Data Structures | Balanced Binary Search Trees | Question 2

2. Data Structures | Balanced Binary Search Trees | Question 2

3. Data Structures | Balanced Binary Search Trees | Question 4

4. Data Structures | Balanced Binary Search Trees | Question 5

5. Data Structures | Balanced Binary Search Trees | Question 13

6. Data Structures | Balanced Binary Search Trees | Question 7

7. Data Structures | Balanced Binary Search Trees | Question 13

8. Data Structures | Balanced Binary Search Trees | Question 9

9. Data Structures | Balanced Binary Search Trees | Question 13

10. Data Structures | Balanced Binary Search Trees | Question 12

11. Data Structures | Balanced Binary Search Trees | Question 13

12. Data Structures | Balanced Binary Search Trees | Question 10

13. Data Structures | Binary Search Trees | Question 1

14. Data Structures | Binary Search Trees | Question 2

15. Data Structures | Binary Search Trees | Question 4

16. Data Structures | Binary Search Trees | Question 5

17. Data Structures | Binary Search Trees | Question 6

18. Data Structures | Binary Search Trees | Question 7

19. Data Structures | Binary Search Trees | Question 10

20. Data Structures | Binary Search Trees | Question 12

21. Data Structures | Binary Search Trees | Question 12

22. Data Structures | Binary Search Trees | Question 3

23. Data Structures | Binary Search Trees | Question 8

24. Data Structures | Binary Search Trees | Question 12

25. Total number of possible Binary Search Trees and Binary Trees with n keys