Question

Complete binary tree with the property that the value at each node is at least as large as the values at its children is called

Answer 1

Answer:

Hy, May it shall help.

Explanation:

Heap is a complete binary tree with the property that the value of each node is at least as large as the values at its children.

Heaps are of two types:

• Min Heap
• Max Heap

The property of Min Heap is that the value of each node is either greater or equal to its parent's value and having minimum value element at the root.

The property of Max Heap is that the value of each node is equal or lesser  to its parent's value and having maximum value element at the root.