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

We have the best collection of Leftlist Heap (Data Structure) MCQs and answer with FREE PDF. These Leftlist 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.

## Leftlist Heap (Data Structure) MCQs

a) 2r

b) 2r-1

c) 2r

d) 2r-1

a) insert

b) merge

c) delete

d) swap

a) insertion

b) merging

c) deletion

d) swapping

a) O(N)

b) O(N log N)

c) O(M log N)

d) O(log N)

a) 1

b) -1

c) 0

d) null

#### 6. Why is this heap named leftist heap?

a) only left subtrees exist

b) the tree is biased to get deep down the left

c) it is balanced

d) right trees are unbalanced

Answer: the tree is biased to get deep down the left

a) left path

b) centre path

c) right path

d) root

#### 8. What would be the result if the left subtree of the root has a null path length of 1 and the right subtree has a null path length of 2?

a) merge occurs without violation

b) violation at left subtree

c) violation at right subtree

d) violation at the root

Answer: violation at the root

#### 9. What happens if the null path length is not updated?

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

Answer: all null path lengths will be 0

a) O(N)

b) O(N log N)

c) O(log N)

d) O(M log N)