Clearing the tree is a useful operation and it helps us to understand
the recursive structure of the algorithms presented here. The procedure
receives a node T that traverses the tree downward starting from left
until it reaches its lowest level. It then traverses the subtree at the
right, deleting a node whenever it reaches a NIL node in the bottom.
This particular procedure performs what is known as post-order
traversal, because it first goes through both the left and right
subtrees before reaching back the root.
1. if (x <> NIL) then
Return to Main Page