Algorithms and OOD (CSC 207 2014S) : Outlines

Outline 40: Implementing Dictionaries with Binary Search Trees


Held: Friday, 11 April 2014

Back to Outline 39 - Implementing Dictionaries with Arrays or Lists. On to Outline 41 - Tree Traversal.

Summary

We consider binary search trees, a somewhat more efficient implementation of dictionaries.

Related Pages

Overview

Administrivia

Extra Credit

About binary search trees

Copyright (c) 2013-14 Samuel A. Rebelsky.

Creative Commons License

This work is licensed under a Creative Commons Attribution 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/3.0/ or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.