Iterationen im sortierten binären Baum III

SortedBinaryTrees.od

TYPE VisitProc = PROCEDURE (object: Objects.Object); (* called by Traverse for all objects of a tree *)

SortedBinaryTrees.om

PROCEDURE Traverse(tree: Tree; visit: VisitProc); (* call visit for all objects in tree in sorted order *) PROCEDURE TraverseInorder(node: Node); BEGIN IF node # NIL THEN TraverseInorder(node.left); visit(node.object); TraverseInorder(node.right); END; END TraverseInorder; BEGIN (* Traverse *) TraverseInorder(tree.root); END Traverse;