Question

Which of the following is a self-balancing Binary Search Tree that ensures a maximum height difference of 1 between the left and right subtrees of any node?

A Red-Black Tree
B Splay Tree
C B-Tree
D AVL Tree
E Treap
Practice Next

Hey! Ask a query