+1 vote
in Data Structures & Algorithms I by (88.2k points)
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

My question comes from Heap in chapter Heap of Data Structures & Algorithms I

I got this question during an interview.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Correct answer is (d) violation at the root

To explain: When two leftist heaps are merged, 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, leftist property is violated at the root.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...