Let Max Heap H Heap Root Heap Maximum Value H Divided H 2 First Half H N 2 1 H N Second Ha Q43800139
let max heap h be the heap that the root of heap is themaximum value. h is divided into h[a / 2] from the first half andh[n/2+ 1] until h[n] of the second half, the first half is storedin array A, and the second half is stored in array B
date of listing, each of the following x On the otherhand,circle the correct one:1 array A is a heapyes because 1- n/2 is parent of leaf
2. array B is a heapno because n/2+1 until n is leaf
3. if n data already stored in heap h. An array that is formedby inserting a value larger than all the value in heap at thebeginning/head of the heap h is assumed to be new array C .The array C is a heap (or) not ?
4 if n data already stored in heap h. A new array D that iscreated by adding a value u to the heap h that is smaller than anyof the n data already stored in heap . if u is added to lastelement in heap , is Array D heap or not?
please explain number 3,4 thanks
Expert Answer
Answer to let max heap h be the heap that the root of heap is the maximum value. h is divided into h[a / 2] from the first half an…
OR