a leftist tree attempts to be veryunbalanced. In addition to theheapproperty, leftist trees are maintained so the right descendant of onode has the lower s-value.
LeftistHeap(LeftistHeap&rhs); ~LeftistHeap(); boolisEmpty(); boolisFull(); int&findMin(); voidInsert(int&x); voiddeleteMin(); voiddeleteMin(int&minItem); voidmakeEmpty(); voidMerge(LeftistHeap&rhs); LeftistHeap&operator=(LeftistHeap&rhs); ...