Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Data Structures | Balanced Binary Search Trees | Question 13

Which of the following is a self-adjusting or self-balancing Binary Search Tree
(A) Splay Tree
(B) AVL Tree
(C) Red Black Tree
(D) All of the above

Answer: (D)
Explanation: See Splay Tree, AVL Tree and Red Black Tree
Quiz of this Question

Article Tags :
Data Structures
DSA
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 7
6. Data Structures | Balanced Binary Search Trees | Question 9
7. Data Structures | Balanced Binary Search Trees | Question 11
8. Data Structures | Balanced Binary Search Trees | Question 12
9. Data Structures | Balanced Binary Search Trees | Question 10
10. Data Structures | Binary Search Trees | Question 1
11. Data Structures | Binary Search Trees | Question 2
12. Data Structures | Binary Search Trees | Question 4
13. Data Structures | Binary Search Trees | Question 5
14. Data Structures | Binary Search Trees | Question 6
15. Data Structures | Binary Search Trees | Question 7
16. Data Structures | Binary Search Trees | Question 10
17. Data Structures | Binary Search Trees | Question 12
18. Data Structures | Binary Search Trees | Question 12
19. Data Structures | Binary Search Trees | Question 3
20. Data Structures | Binary Search Trees | Question 8
21. Data Structures | Binary Search Trees | Question 12
22. Total number of possible Binary Search Trees and Binary Trees with n keys
23. Merge Two Balanced Binary Search Trees
24. Data Structures | Binary Trees | Question 1
25. Data Structures | Binary Trees | Question 15