Question

)a___ is a complete binary tree such that each node in the tree contains a comparable object that us greater than or equal to the objects jn the nodes descendants

A. Binheap

B. Maxheap

C. Fullheap

D. Minheap

Answer 1

(B) Maxheap.

Step-by-step explanation:

Complete binary tree:-It is a binary tree having every level filled completely excluding the last level .

Max heap:-It is a binary tree which is complete or complete binary tree in which the root node is greater than or equal to it's children or we can say descendants.So according to the question the answer is MaxHeap.