One main difference between a binary search tree (BST) and an AVL (Adelson-Velski and Landis) tree is that an AVL tree has a balance condition, that is, for every node in the AVL tree, the height of the left and right subtrees differ by at most 1 . Starting with an empty BST and AVL tree, insert the following keys into the two trees (BST as well as AVL trees)