There are many natural algorithms on binary trees that could be described recursivly. The scheme for recursions on binary trees is suggested in the following figure:
Procedure recursive_on_tree( node n)
Examples:
Procedure Preorder_Traversion( node n)
Procedure Inorder_Traversion( node n)
Procedure Postorder_Traversion( node n)
Examples:
Traverse the tree in (in | post | pre)-order
Last modified: 27/July/98 (12:14)