Heaps - Study Mode

Show All Answers

[#156] How many comparisons will occur while performing a delete-min operation?

(A) d

(B) d-1

(C) d+1

(D) 1

Correct Answer

(B) d-1

[#157] Choose the option with function having same complexity for a fibonacci heap.

(A) Insertion, Union

(B) Insertion, Deletion

(C) extract_min, insertion

(D) Union, delete

Correct Answer

(A) Insertion, Union

[#158] Which type of data structure is a ternary heap?

(A) Array

(B) Hash

(C) Priority Queue

(D) Priority Stack

Correct Answer

(C) Priority Queue

[#159] Naive merge cannot be done in a skew merge.

(A) true

(B) false

Correct Answer

(B) false

[#160] Which of the heaps is implemented by the following figure?

(A) fibonacci heaps

(B) pairing heap

(C) skew heap

(D) leftist heap

Correct Answer

(B) pairing heap