next | next | up | down | Inhalt | Kommentar

all, section 6.11.

6.11.  Operations on Binary Search Trees

A common activity found in a variety of computer programs is the maintenance of a set of values from which we wish to:

1.   insert elements into the set
2.   delete elements from the set
3.   look up an element to see whether it is currently
     in the set.

back | next | up | down | Inhalt | Kommentar


Created by unroff & hp-tools. © by Hans-Peter Bischof. All Rights Reserved (1997).

Last modified 22/May/97