Binary Tree Terminology
Given a binary tree T of n nodes, n ³ 0,
then v is a descendent of u if either
v is equal to u or
v is a child of some node w and w is a descendant of u.
We write v descT u.
v is a proper descendent of u if v is a descendant of u and v ¹ u.
Previous slide
Next slide
Back to first slide
View graphic version