The height of a tree g is defined as the vertex height of its root vertex, where the vertex height of a vertex v in a tree g is the number of edges on the longest downward path between v and a tree leaf. A function to return the height of a vertex v in a tree g may be implemented in a future version of the Wolfram Language as TreeHeight[g, v], and a function to return the height of a tree as TreeHeight[g].

rooted tree | root vertex | tree | tree leaf