A Kotlin implementation of AVL Tree, a self-balancing binary search tree. This implementation allows you to insert elements into the tree and it will keep the height of the tree balanced.
To use the AVL Tree, simply create an instance of the `AVLTree