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