Draw a binary search tree and AVL tree from the following traversals:

{15, 5, 20, 70, 3, 10, 60, 90, 16}

• Delete 15 and re-draw both Binary Search Tree and AVL Tree drawn in given traversal.
• Reverse path of Binary Search Tree drawn
• Convert Binary Search Tree into Binary Tree such that sum of all greater keys is added to every key.
• Write a code to Convert Binary Search Tree drawn into Balanced Binary Search Tree