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