Gator AVL Project Problem Statement Binary Search Trees $($BST$)$ can often be an efficient and useful way to store and retrieve sorted data. However, the efficiency of these data trees relies heavily on how balanced a BST is$.$ For example, searching through the BST on the left is much more efficient than searching through the BST on the right, despite both figures showing valid BST with the exact same elements.

Your program must support the following commands: