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



My Personal Notes arrow_drop_up



Practice Tags :

Recommended Posts:



0 Average Difficulty : 0/5.0
No votes yet.






User Actions