Leftist Heap Properties
Heap-order property
- parent’s priority value is ? to childrens’ priority values
- result: minimum element is at the root
Leftist property
- null path length of left subtree is ? npl of right subtree
- result: tree is at least as “heavy” on the left as the right
Are leftist trees complete? Balanced?