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

1. How many nodes does a leftist tree with r nodes must have?

a) 2r

b) 2r-1

c) 2r

d) 2r-1

Answer: 2r-1

2. Which of the following operations does not destroy the leftist heap property?

a) insert

b) merge

c) delete

d) swap

Answer: delete

3. What is the fundamental operation on leftist heap?

a) insertion

b) merging

c) deletion

d) swapping

Answer: merging

4. What is the efficiency of merge used in leftist heaps?

a) O(N)

b) O(N log N)

c) O(M log N)

d) O(log N)

Answer: O(log N)

5. What is the node path length of a node with 0 or 1 child?

a) 1

b) -1

c) 0

d) null

Answer: 0

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

7. In a leftist heap, all the operations should be performed on?

a) left path

b) centre path

c) right path

d) root

Answer: right path

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

10. What is the time taken to delete a minimum element in a leftist heap?

a) O(N)

b) O(N log N)

c) O(log N)

d) O(M log N)

Answer: O(log N)

Leftlist Heap (Data Structure) MCQs PDF Download

Categories: Heap