+1 vote
in Data Structures & Algorithms I by (88.2k points)
In a leftist heap, the null path length of a null node is defined as?

(a) 0

(b) 1

(c) null

(d) -1

I'm obligated to ask this question of Heap topic in chapter Heap of Data Structures & Algorithms I

This question was posed to me in an interview for internship.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct choice is (d) -1

To explain: In a leftist heap tree, the null path length of a null node with no children is defined as -1.

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.