Balanced Binary Search Trees
Dinesh P. Mehta, Dinesh P. Mehta, Sartaj Sahni · 2004
Balanced binary search trees are among the most important data structures in Computer Science. This is because they are efficient, versatile, and extensible in many ways. They are used as a black-box in numerous algorithms and even other data structures.