Write a program in Java to implement AVL insert.

Create an AVL tree using single rotation and double rotation. Insert at least 15 nodes in random order.

After all the nodes are inserted, print the left and the right height of the last node inserted (should be 0 or can be 1 if a zigzag rotation happened after the last insert). Go all the way to the root to print left and right height.