Generic Data Structures

Collaboration diagram for Generic Data Structures:

A set of data structure implementations with interfaces that allow for generic use. More...

Modules
	AA-Tree
	An implementation of an AA-Tree -- a balanced binary tree.
	Vector
	A resizable array that can optionally act as a binary heap.

---

Detailed Description

A set of data structure implementations with interfaces that allow for generic use.

To assist in implementing these algorithms, I used Mark Allen Weiss's text "Data Structures and Problem Solving Using C++", second edition. While I didn't have a copy of the C version of the text, I still found it extremely useful. The source code here is not copied from the text; I developed it based on what I learned from the text.

---