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

The origin of the question is Heap topic in chapter Heap of Data Structures & Algorithms I

I got this question in my homework.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right option is (b) the tree is biased to get deep down the left

The best explanation: The heap is named as leftist heap because it tends to have deep left paths. It follows that the right path ought to be short.

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.