Map

This project implements a map class built on an existing binary search tree class.

The main function serves to exercise the class.

The classes that begin with "d_" are existing classes - I did not develop these, but used them in the map class.

This project also uses "debugnew" (see the Dijkstra folder).

This was the third of four projects in
CS 315 - Data Structures, Sonoma State University, Fall 2003
Taught by Dr. Richard Gordon

• d_except.h
• d_stiter.h
• d_stree.h
• main.cpp
• map.h

--Back--