Q2. a. What is a Binary Search Tree? b. Draw the Binary Search Tree that results from the insertion, one at a time, of nodes with Keys 27, 59, 21, 38, 54, 63, 8, 70, 15, 12. (Marking Scheme: Each...

Q2. a. What is a Binary Search Tree?

       b. Draw the Binary Search Tree that results from the insertion, one at a time, of nodes with

         Keys 27, 59, 21, 38, 54, 63, 8, 70, 15, 12.

         (Marking Scheme: Each correct insertion in the tree will give you

     c. Perform the following operations on the original tree and redraw the tree after each operation

       )

                       i.deleting   63

                       ii.deleting   59

                       iii.Insert      65

                      iv.Insert       22

     d. Write down the inorder, preorder and postorder traversal on the constructed binary tree.