Binary Tree Terminology
The height of T is defined recursively as 0 if T is empty and 1 + max(height(T1), height(T2)) otherwise, where T1 and T2 are the subtrees of the root.
The height of a tree is the length of a longest chain of descendants
Previous slide
Next slide
Back to first slide
View graphic version