This program was designed to take a text file as input and create an index for all (or a subset) of the words appearing therein, in alphabetical order and with page numbers listed.

It was implemented using an AVL tree that additionally performed single or double rotations on nodes to push frequently occuring words towards the top of the tree. This implementation runs significantly quicker than a comparable, though simpler to program, PSB tree.