Although our implementation structure is quite
different from any we have used before, we have changed the name of
only one list operation: has replaced . Of course, the algorithms we develop to implement the
operations differ from those used for the list operations.
Replace the list operations with the
corresponding tree operations in any of the applications that we
have written for the other List ADTs and you have an application of
the Binary Search Tree ADT. Although binary search trees are
interesting mathematical objects, they are used mainly in computing
as implementation structures for lists.