1.

Define Heap?

Answer»

A HEAP is defined to be a complete BINARY TREE with the property that the value of each node is atleast as small as the value of its child nodes, if they exist. The root node of the heap has the SMALLEST value in the tree.

A heap is defined to be a complete binary tree with the property that the value of each node is atleast as small as the value of its child nodes, if they exist. The root node of the heap has the smallest value in the tree.



Discussion

No Comment Found