Binary Trees

Various binary tree's and there iterators. If your unsure what to use, the class AVLTreeC is recommended, its is self balancing and will work well no mater what order data is presented to it.

Normal classes:

BinaryTreeUpIterC	Iterate up through a binary tree.
BinaryTreeDownIterC	Iterate down through a binary tree.
BinaryTreeC	Binary tree.
AVLTreeC	AVL Tree.
HashTreeC	Tree of hashtables.
HashTreeIterC	Iterate through a tree.

Normal functions:

operator <<(ostream &,const HashTreeC &)
operator >>(istream &,HashTreeC &)
operator <<(ostream &,const HashTreeNodeC &)
operator >>(istream &,HashTreeNodeC &)	Add a child with given key and data.

Advanced classes:

HashTreeNodeC

Base class for tree's.