Returns the number of edges on the longest path between this node and a descendant leaf (0 for a leaf). Implemented iteratively, so it is safe on arbitrarily deep trees.
the height of this subtree, measured in edges.