case classLeftistHeapOps(heap: HeapNode) extends Product with Serializable
A leftist heap.
Each node maintains a "rank", which records the length of the path between
the node and the right most leaf.
Invariants:
1. For each node, the height of its right subtree <= that of its left subtree.
2. For each node, the rank of its right child <= the rank of its left child.
Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
A leftist heap. Each node maintains a "rank", which records the length of the path between the node and the right most leaf. Invariants: 1. For each node, the height of its right subtree <= that of its left subtree. 2. For each node, the rank of its right child <= the rank of its left child.