Question

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.

Answer 1

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.