Heaps MCQ question and answer with solution | Data Structure MCQs

A. Heapify

B. Hashing

C. Linking

D. Merging

A. insert

B. delete

C. find

D. merge

A. O(n)

B. O(nlogn)

C. O(logn)

D. O(1)

A. O(log n)

B. O(n)

C. O(n logn)

D. O(1)

A. splay tree

B. treap

C. red-black tree

D. avl tree

A. O (log n/ log 3)

B. O (n!)

C. O (n)

D. O (1)

A. 5 will be at root

B. 5 will be at last level

C. 5 will be at second level

D. 5 can be anywhere in heap

A. 31

B. 12

C. 18

D. 22

A. O (log n/ log 3)

B. O (n!)

C. O (n)

D. O (1)

A. Every node has value greater than the value of child node

B. Every right child of node has greater value than parent node

C. Every left child of node has greater value than parent node

D. Every left and right child of node has same value as parent node