depth(T::
cerl:cerl()
) -> non_neg_integer()
cerl:cerl()
) -> non_neg_integer()
Returns the length of the longest path in the tree. A leaf node has depth zero, the tree representing "{foo, bar}
" has depth one, etc.