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

› Category: Questions › The roots of the elements of the subtrees are smaller than the root of the heap.
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months 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.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months 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.


Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40701

Related Posts