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.