Let heap stored in an array as H 50 40 37 32 28 22 36 13 In-03562
Let heap stored in an array as <br>H = [50, 40, 37, 32, 28, 22, 36, 13]. <br>In other words, the root of the heap contains the maximum element. What is the result of deleting 40 from this heap
This multiple choice question (MCQ) is related to the book/course
vu cs301 Data Structures.
It can also be found in
vu cs301 Mid Term - Quiz No.5.
Let heap stored in an array as
H = [50, 40, 37, 32, 28, 22, 36, 13].
In other words, the root of the heap contains the maximum element. What is the result of deleting 40 from this heap
H = [50, 40, 37, 32, 28, 22, 36, 13].
In other words, the root of the heap contains the maximum element. What is the result of deleting 40 from this heap
[50,32, 37,13, 28, 22, 36]
[37, 28, 32, 22, 36, 13]
[37, 36, 32, 28, 13, 22]
[37, 32, 36, 13, 28, 22]
