+1 vote
in Data Structures & Algorithms I by (88.2k points)
The roots of the elements of the subtrees are smaller than the root of the heap.

(a) True

(b) False

This intriguing question originated from Heap in chapter Heap of Data Structures & Algorithms I

I have been asked this question in homework.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct choice is (b) False

For explanation: The heap ordering property requires that all the root elements of the subtrees in the list are not smaller than the root element of the heap.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.