CS301 – Data Structures
Your assignment must be uploaded/submitted at or before July 14, 2010
Rules for Marking
It should be clear that your assignment will not get any credit if:
o The assignment is submitted after due date.
o The submitted assignment does not open
o The assignment is copied.
The objective of this assignment is to provide on hand experience of:
o Complete Binary Tree
o Building a Heap
o Insertion and deletion from a Heap
Consider the array element given below
13 11 2 15 7 6 9 16 4 10 8 5 12 14 3
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Make a Complete binary tree by using the array elements and then perform the following operations. 2
a) Make a Max Heap out of the Complete binary tree by using BuildHeap method, show all steps. 5
b) Make a Min Heap out of the Complete binary tree by using BuildHeap method, show all steps. 5
c) Show the results after inserting a value 17 in Max Heap developed in option (a). 4
d) Show the results after deleting the minimum number from Min Heap developed in option (b).
Please Discuss Here about this assignmet.Thanks