Data Structures - AVL Trees

AVL Trees are self balanced binary search trees. Most of the functions for the AVL Tree are the same as the functions for binary search trees. Included is my c++ implementation of the banking assignment we used a link list for. I have converted this program to use an AVL Tree instead of a linked list. This program reads in account data from a file, searches for an account, and outputs all account data to the screen and a file.

AVL Tree Banking Sample