reshown by
1,397 views

2 Answers

0 votes
0 votes
no,  max heap is not possible bcoz it is failing the property at node 8 insertion time.  but if we are implementing it by array then there is basic fault in question bcoz in array data type should be similar here .6 is given which is float type.
0 votes
0 votes

The Node with Value $6$ and $7$ violates the $Max-HEAP$ $Property$, according to which the $Parent[key] >= Child[key]$

Related questions

1 votes
1 votes
0 answers
1
akash.dinkar12 asked Apr 5, 2019
286 views
Show that, with the array representation for storing an $n$-element heap, the leaves are the nodes indexed by $\lfloor n/2\rfloor +1$,$\lfloor n/2\rfloor +2,…,n$
3 votes
3 votes
4 answers
2
akash.dinkar12 asked Apr 5, 2019
2,697 views
Where in a max-heap might the smallest element reside, assuming that all elements are distinct ?
0 votes
0 votes
1 answer
3