Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

We can also show that a variation of the above algorithm performs operation
findAll(k) in time O(h + s), where s is the number of entries returned.
However, this method is slightly more complicated, and the details are left as an
exercise (C-10.1).
Admittedly, the height h of T can be as large as n, but we expect that it is usually
much smaller. Indeed, we will show how to maintain an upper bound of O(logn)
on the height of a search tree T in Section 10.2. Before we describe such a
scheme, however, let us describe implementations for dictionary update methods.
10.1.2 Update Operations
Binary search trees allow implementations of the insert and remove operations
using algorithms that are fairly straightforward, but not trivial.
Insertion
Let us assume a proper binary tree T supports the following update operation:
insertAtExternal(v,e): Insert the element e at the external node v, and
expand
v to be internal, having new (empty) external node children;
587