He gave the name k-balanced trees to the class of binary search trees balanced in this manner. In this chapter, we present an implementation for k- balanced trees where k is termed the balancing control factor regulating the frequency of rebalancing operations....
This chapter presents the unbounded form of binary search tree further described in §4.2. In §4.1 is the standard operations and exceptions module used by all tree modules in this volume. The interface to the unbounded binary search tree is covered in §4.2 while its implementation follows in...