A complete binary tree in which the value at each node is at least as large as…
2008
A complete binary tree in which the value at each node is at least as large as the values of its children is known as a:
- A.
Binary search tree
- B.
AVL tree
- C.
Completely balanced tree
- D.
Heap
Attempted by 364 students.
Show answer & explanation
Correct answer: D
Correct answer: Heap
A heap is a complete binary tree that satisfies a heap-order property.
Here, each node is at least as large as its children, so the structure is specifically a max-heap. The option given is the general term Heap.
A video solution is available for this question — log in and enroll to watch it.