Question

______ 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.

Answer 1

Hello here is your answer by Sujeet yaduvanshi ☝☝☝☝☝

ANS:+ Heap

Answer 2

Answer: Heap.

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.

Heaps undertakes various operation which are as follows :

Find-min: It helps out in searching for the lowest key node available amongst a group of nodes

Find-max: It helps out in searching for the highest key node amongst a group of nodes

Delete-min: It helps in deleting the lowest key node amongst a group of nodes

Delete-max: It helps in deleting the highest key node amongst a group of nodes

Hope this helps.