To find the minimum element stored in a heap
A) you should start at the root,and then keep passing from each node to its left child until you come to a node with no left child
B) you should start at the root,and then keep passing from each node to its right child until you come to a node with no right child
C) you should look at the root of the binary tree
D) you need to examine every node,and then pick the one with the least value

Question

Quizplus · Accepted Answer

The minimum element is always stored at the root of the heap. This is the property of a min-heap where the parent node always has a smaller value than its children. Hence, checking the root node will give us the minimum element without having to examine every node.

To Find the Minimum Element Stored in a Heap