Height of a Tree

• Definition is same as level. Height of a tree is the length of the longest path from root to some leaf node.

• Height of a empty tree is -1.

• Height of a single node tree is 0.

• Recursive definition:

• height(t) = 0 if number of nodes = 1

  = -1 if T is empty
  
  = 1+ max(height(LT), height(RT)) otherwise

Previous slide

Next slide

Back to first slide

View graphic version