The roots of the elements of the subtrees are smaller than the root of the heap.

Category: QuestionsThe roots of the elements of the subtrees are smaller than the root of the heap.
Editor">Editor Staff asked 1 month ago

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 Answers
Editor">Editor Staff answered 1 month ago

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.