Binary Tree

template <typename Key, typename Info> // keys are unique
class Dictionary // AVL Tree
{
	// inserting, removing elements, appending etc.
	void graph(); // print tree (Nihoff book)
}

Testing function

Uses Dictionary <string, int>
Reads text file
If string is not in the dictionary, add to it with int = 1
int is basically a count
If string is in dictionary, increate the int

Dictionary shouldn't have operation increaseInfo etc.