Question

Q6: Find out the array representation of the given min-heap, if the value 25 is inserted in it. a) 10, 15, 25, 50, 40, 100, 30 10, 15, 30, 40, 50, 100 b) 10, 15, 25, 40, 50, 100, 30 c) 15, 10, 25, 40, 50, 100.30 d) 10. 15. 25. 40, 50, 30, 100​

Answer 1

Answer:

gckihgcfyjjvgjkvtyuiuytchikb

Answer 2

c. 15,10,25,40, 50, 100, 30

Explanation:

min Heap is the heap in which the value of a node is greater than or equal to the value of its parent node.

The root node of the min-heap is the smallest.

A Binary Heap is a Complete Binary Tree.

A binary heap is typically represented as array. The representation is done as: The root element will be at Arr[0].