The minimum is removed from the min-heap by moving the last element to the root and sifting it down. What is the resulting array?
Correct answer B. [3, 4, 7, 10, 8]
Subject / 929 questions
Page 28 of Programming multiple-choice questions with answers. Tap an option to check yourself.
Page 28 of 47
Correct answer B. [3, 4, 7, 10, 8]
Correct answer D. Queue
Correct answer C. Stack
Correct answer D. O(V²)
Correct answer D. A, B, D, E, F, C
Correct answer B. A, C, B, D, E
Correct answer C. A directed acyclic graph (DAG)
Correct answer B. 13
Correct answer C. 11
Correct answer C. It finalises a vertex's distance when the vertex is removed from the queue, assuming later paths cannot be shorter
Correct answer C. 4
Correct answer C. Floyd's tortoise and hare algorithm
Correct answer A. O(1)
Correct answer B. O(n)
Correct answer B. To remove special cases for inserting or deleting at the front of the list
Correct answer A. 4
Correct answer A. Last In, First Out (LIFO)
Correct answer D. 3, 4, 2, 5
Correct answer B. Underflow
Correct answer A. top == MAX − 1