Consider the following MinHeap. After removing two times, t…

Consider the following MinHeap. After removing two times, the heap will contain only 6 elements.  What would be the Level-order traversal of the heap?  Write your answer as a series of digits with no commas or spaces. Do not worry if Canvas automatically inserts a comma in your response. 

A complete tree is stored in an array with index 0 being unu…

A complete tree is stored in an array with index 0 being unused and the root stored in index 1.   If an element in the tree has the index i, which are the correct references to the parent, the left child, and the right child?    parent [blank1] left child [blank2] right child [blank3]