SICP Exercise 2.66 lookup

Exercise 2.66.  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.

SOLUTION

The code and tests are here.

Comments

Popular posts from this blog

SICP Exercise 1.22 search-for-primes

SICP Exercise 4.2 Louis Reasoner eval

SICP Exercise 3.45 deadlock