Tree height

From Wikipedia, the free encyclopedia

The height of a node in a tree is defined as length of the path to its furthest child. This is commonly needed in the manipulation of the various self balancing trees, AVL Trees in particular.

This data structure-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../t/r/e/Tree_height.html"