leftist heaps

The difference between binary heaps and leftist heaps is that leftist heaps
is not perfectly balanced.
Null path length of any node X is the length of the shortest path from X to
a node without 2 children.
Npl(NULL) = -1;