Show that storing the length of the right path for each node in the tree enables you to impose a balancing condition that yields logarithmic worst-case time per operation. Such a structure is called a...

Show that storing the length of the right path for each node in the tree enables you to impose a balancing condition that yields logarithmic worst-case time per operation. Such a structure is called a leftist heap. Show that using a stack to implement the combineSiblings operation for pairing heaps is bad. Do so by constructing a sequence that has linear amortized cost per operation.