data structure course

the array:

26 78 | 12 79199 | 18 30 60 75 38 88 81 86 4 37 95 a. What is the heap of the unsorted array? (2 Marks) D 2 3 4 7 8 9 10 11 12 13 14 15 6 0- 1- 2 3 4 5- 6- 7- 8- 9- 10- 11- 12- 13- 14- 15 b. Re-draw the heap after deleting the largest number (2 Marks) 0- 1- 2 3 4 6- 7- 8- 9- 10- 11- 12- 13- 14- 5- c. Write the function to create a heap. (3Marks) d. Distribute the unsorted numbers in the binary search tree below (3 Marks) e. For the BST above, write a function to print the nodes with one child only? ( 2 Marks)