Suppose S is a sorted set of data, x is a data object, and k is a search key.
The Search, Insert, and Remove operations are called "dictionary" operations.