Length of the shortest path to an empty node
This is equivalent to RANK-LT.
Returns the length of the shortest path to an empty node. We will prove that this equals the rank of the tree.