Suppose we are implementing a priority queue by using an array-based heap for which the ith element of the array is the parent node of the nodes 2i+1 and 2i+2 of the array (if not empty) an the root node is stored at index 0. Suppose we have the array below:
2 3 6 7 9 4 8 7 11 12 15 3 7 11 13 6 5
Draw the array-based tree
