AVL Tree Simulator Version 1.21

AVL tree is a binary search tree that always has left and right height differ not more than 1. That means it can rotate to make the tree balance.

red root means
subtree on the left is deeper

yellow root means
both left and right subtrees have equal height

green root means
the right subtree is deeper