What data structure is defined as a complete binary tree in which each node's value is greater than or equal to the values of its children?

• A. Min-Heap
• B. Max-Heap
• C. Binary Search Tree
• D. AVL Tree

Answer: (B)

A max-heap is the structure described: a complete binary tree in which each node’s value is greater than or equal to the values of its children. The complete property ensures the tree is filled level by level from left to right, which makes operations efficient and allows array-based implementations. The heap property—parent ≥ children—puts the largest element at the root and guarantees that no child is larger than its parent. This is what distinguishes it from a min-heap (where parent ≤ children), a binary search tree (which orders nodes relative to ancestors but doesn’t require completeness), and an AVL tree (a balanced binary search tree with height balance, not defined by heap order). So the described data structure is a max-heap.