. (2 pts. per part) | |||||||||||||||||||||||||||||||||||
1. Assume the usual array representation of a heap. If the current heap size is 11, draw the heap as a tree.
2. Go back to the array representation. Modify the array to show the results of adding the value 18 to the heap. [Show this directly on the array above].
|
|||||||||||||||||||||||||||||||||||