Fund. CS II (CS152 2004F)

Class 38: Dictionaries (2): Binary Search Trees

Back to Dictionaries (1). On to Project Discussion.

Held: Monday, 8 November 2004

Summary: Today we consider a tree-based implementation of dictionaries, the binary search tree.

Related Pages:

Notes:

Overview:

A Data Structure for Binary Search

Search Trees

Back to Dictionaries (1). On to Project Discussion.

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:37:24 2004.
The source to the document was last modified on Thu Aug 26 20:22:24 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS152/2004F/Outlines/outline.38.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu