Heaps - Study Mode

Show All Answers

[#51] Which of the following operations is not directly supported by a binary heap?

(A) Searching for an arbitrary element

(B) Inserting an element

(C) Extracting the maximum/minimum

(D) Building a heap

Correct Answer

(A) Searching for an arbitrary element

[#52] In a binary heap represented as an array, what is the index of the left child of the node at index i?

(A) 2 * i + 1

(B) 2 * i

(C) 2 * i + 2

(D) 2 * i - 1

Correct Answer

(A) 2 * i + 1

[#53] What is the space complexity of a binary heap when stored in an array?

(A) O(1)

(B) O(log n)

(C) O(n)

(D) O(n log n)

Correct Answer

(C) O(n)

[#54] Which operation involves moving a node to maintain the heap property after insertion in a binary heap?

(A) Bubble-up or Percolate-up

(B) Bubble-down or Percolate-down

(C) Heapify

(D) Restructure

Correct Answer

(A) Bubble-up or Percolate-up

[#55] In a max-heap, what is the time complexity to find the second largest element?

(A) O(1)

(B) O(log n)

(C) O(n)

(D) O(n log n)

Correct Answer

(B) O(log n)