1. Contents
  2. 2 Building Abstractions with Data
  3. 2.3 Symbolic Data
  4. 2.3.3 Example: Representing Sets
  5. Exercise 2.66
Previous Next
2.3.3. Example: Representing Sets
Exercise 2.66

Lookup procedure

Implement the lookup procedure for the case where the set of records is structured as a binary tree, ordered by the numerical values of the keys.

There are no comments yet.

Authentication required

You must log in to post a comment.

Login