Consider a binary search tree (BST) whose elements are the name of animals. Starting with an empty BST, show the effect of successively adding the following elements: cow, fox, bat, ant, lion, cat,...

Consider a binary search tree (BST) whose elements are the name of animals.

1. 
   
   
   
   1. Starting with an empty BST, show the effect of successively adding the following elements:cow, fox, bat, ant, lion, cat, goat, dog,andpig.
      
   
   
   2. Show the effect of successively deletingfox, cow,andbat from the resulting BST and Traverse the original BST inpre-order,in-orderandpost-order.