Do this in C++, and especiallydon't forgot the last part

Create a tree class. You can use my examples as the initial guideline. Review https://www.cise.ufl.edu/~nemo/cop3530/AVL-Tree-Rotations.pdf http://www.cs.usfca.edu/~galles/visualization/AVLtree.html http://www.cs.usfca.edu/~galles/visualization/BST.html Functions to include would be insert, delete, balance, print with the 4 types of traversals. Show that it works by randomly filling the tree, and selectively deleting elements and then traversing the tree.