You will draw an AVL and binary search tree diagram for a sequence of only 9 numbers. You will then derive the outputs for pre-order, in-order and post-order traversal for both trees. Finally you will answer one question about why the outputs differ between the normal BST and the balanced AVL tree.