Fund. CS II (CS152 2004F)

Homework 40: Comparing Keyed Values

Due: Wednesday, 10 November 2004

In order to implement dictionaries using binary search trees, we need to insert keyed values into the binary search trees and search only on the key (rather than the value).

Write a KeyedValueComparator to help with that implementation.

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Wed Dec 8 10:36:57 2004.
The source to the document was last modified on Tue Nov 9 10:54:12 2004.
This document may be found at

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky,