(definition)

**Definition:**
The maximum distance of any *node* from the *root*. If a tree has only one node (the root), the height is zero. The height of an empty tree is not defined.

*Note:
An equivalent definition is: the height is the maximum depth of any node. *

The height of the figure at the definition of *tree* is two.

* The height of a tree is also known as the order.*

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 26 May 2011.

HTML page formatted Mon Feb 2 13:10:39 2015.

Cite this as:

Paul E. Black, "height", in
*Dictionary of Algorithms and Data Structures* [online], Vreda Pieterse and Paul E. Black, eds. 26 May 2011. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/height.html