1. Build a binary search tree from the following data set and the perform pre-order, post-order, and in-order traversal of the tree

 89, 

0,

 45,

 89, 

98,

 78, 

100,

 56 

2. [Heap] a) Build a heap from the following data set 

89, 0, 45, 89, 98, 78, 100, 56 

b) Suppose we need to store the heap constructed above in an arraylist of Integers. Show how data will be stored in the arraylist for above heap

 c) Perform the heap sort for the heap stored in the arraylist above. Show the content of the arraylist in each step