Heaps MCQ question and answer with solution | Data Structure MCQs

A. insert

B. delete

C. find

D. create

A. Prim's Algorithm

B. Euclid's Algorithm

C. Eight Queen Puzzle

D. Tree

A. O(N)

B. O(log N)

C. O(N²)

D. O(M log N)

A. d

B. d-1

C. d+1

D. 1

A. Insertion, Union

B. Insertion, Deletion

C. extract_min, insertion

D. Union, delete

A. Array

B. Hash

C. Priority Queue

D. Priority Stack

A. true

B. false

A. fibonacci heaps

B. pairing heap

C. skew heap

D. leftist heap

A. error occurs

B. all null path lengths will be 0

C. all null path lengths will be -1

D. all null path lengths will be 1

A. 1

B. 10

C. 18

D. 20