Suppose S is a sorted set of data, x is a data object,
and k is a search key.
-
Search(S,k): Search for an x in S such
that x.key = k
-
Insert(S,x): Insert x in S
-
Remove(S,x): Remove x from S
-
Minimum(S): Return the element of S with the smallest key
-
Maximum(S): Return the element of S with the largest key
-
Successor(S,x): Return the element of S whose key is
the next largest than that of x
-
Predecessor(S,x): Return the element of S whose key is
the next smallest than that of x
The Search, Insert, and Remove operations are
called "dictionary" operations.
The Insert, and Remove, and Minimum
(or Maximum) operations are required by priority queues.