(a) For the data in this file construct a Binary Search Tree.<br/>

(b) Print the data sequence if this tree is traversed In-order.
(c) Print the data sequence if this tree is traversed Pre-order.
(d) Print the data sequence if this tree is traversed Post-order. 
(e) For the data in this file construct a Heap. Only give the final tree as your solution.
(f) Remove one element from the Heap and draw the resulting tree.  
(g) If this data is loaded in an array and that array be sorted using Insertion Sort, show the state of array after each insertion step.  
(h)  If this data is loaded in an array and that array be sorted using Merge Sort, trace the algorithm showing the state of array (or sub arrays) at and after each call. Here the focus is also on your presentation that how neatly and logically you present this. You may use MS-Excel or MS-Word instead of hand writing for this one.  


-----subject is data structures and algorithms------