Exercise 2.66
Printer-friendly versionImplement 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.
Corresponding Section:
Printer-friendly versionAnnotated SICP
- Structure and Interpretation of Computer Programs
- Front Matter
- 1 Building Abstractions with Procedures
- 2 Building Abstractions with Data
- 3 Modularity, Objects, and State
- 4 Metalinguistic Abstraction
- 5 Computing with Register Machines
- References
- List of Exercises
Comments
Post new comment