Class group project for Principles of Programming Languages course. AVL Tree simulation can perform insertion, deletion of a node. Can find a node in the tree. Also, it can print the Preorder, Inorder and Postorder traversal of the tree. Height and number of vertices are updated with each operation performed. See the file attached for complete report.