Computer Science Fundamentals (CS153 2004S)

Class 53: Implementing Dictionaries with Binary Search Trees

Back to Implementing Dictionaries with Hash Tables. On to Discussion of Exam 3.

Held: Wednesday, 5 May 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

Using Binary Search Trees for Dictionaries

 

History

 

Back to Implementing Dictionaries with Hash Tables. On to Discussion of Exam 3.

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 Fri May 7 09:43:37 2004.
The source to the document was last modified on Tue Jan 13 10:26:12 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2004S/Outlines/outline.53.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu