This is an implementation of a binary search tree I wrote in grade 12. It reads through a text file for bank clients and sorts them into a tree. The user has the ability to add, remove, search, and display the clients.