Question

implementation of heap in data structure​

Answer 1

Answer:

A heap is a useful data structure when it is necessary to repeatedly remove the object with the highest (or lowest) priority. A common implementation of a heap is the binary heap, in which the tree is a binary tree (see figure). ... The maximum number of children each node can have depends on the type of heap.

I hope it will help you...

Answer 2

Answer:

A heap is a useful data structure when it is necessary to repeatedly remove the object with the highest (or lowest) priority. A common implementation of a heap is the binary heap, in which the tree is a binary tree (see figure). ... Heaps are also crucial in several efficient graph algorithms such as Dijkstra's algorithm.

hope it helps you.