# 50+ Weak Heap (Data Structure) MCQs with FREE PDF

We have the best collection of Weak Heap (Data Structure) MCQs and answer with FREE PDF. These Weak Heap (Data Structure) MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Weak Heap MCQs

a) O(log n)

b) O(n)

c) O(n logn)

d) O(1)

#### 2. The total comparisons in finding both smallest and largest elements are

a) 2*n +2

b) n + ((n+1)/2) -2

c) n+logn

d) n2

a) Yes

b) No

a) h

b) h-1

c) h or h-1

d) h-2

#### 5. Choose the correct properties of weak-heap.

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

Answer: Every right child of node has greater value than parent node

a) True

b) False

a) Min-heap

b) Max-heap

c) Relaxed -heap

d) Leonardo heap