A binary max heap can be stored as an array. Consider the following example:

Array representation of the heap:

Index	0	1	2	3	4	5	6	7	8	9
Value		80	18	40	13	5	25	1	2	9

Note that-

We left the 0th position of the array

Left child of A[ i ] can be found at A[ 2*i ].

Right child of A[ i ] can be found at A[ 2*i+1 ].

The parent of A[ i ] is at A[ i/2 ].

Consider the the following array of length 6. Elements from the array are added, in the given order, to a max heap. The heap is initially empty and stored as an array.

A = {3, 2, 15, 5, 4, 45}

What will be output array (heap)?

index	0	1	2	3	4	5	6
values		Answer 0	Answer 1	Answer 2	Answer 3	Answer 4	Answer 5