Go backward to ExampleGo up to TopGo forward to Example |

*Definition:*
The *level* of a node `x` in a tree is the length of the
path from the root of the tree to `x`:

level _{T}(x) := length(p)wherep=suchp:pis path inT/\pis path from root(T) tox.

The *height* of a tree is the maximum level of its nodes:

height( T) := max {level_{T}(x):xinV}whereV=T_{0}.

*Root has level 0; level of every other node is one plus the parent
level.*

Author: Wolfgang Schreiner

Last Modification: January 26, 2000