A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as
- A. Binary search tree
- B. AVL tree
- C. Completely balanced tree
- D. Heap
Answer: D. Heap
Explanation: This is the max-heap property.