| Calling Sequence | for n in Infix(tree) do ... od;
| |||||||||
| Parameters |
| |||||||||
| Return Type | Tree | |||||||||
| Synopsis | This is an iterator which returns all the nodes (internal nodes of type "Tree" or external nodes of type "Leaf") of a tree in infix order. Infix order means that the left subtree is visited first, then the node, then the right subtree, for every node recursively. | |||||||||
| See also | iterate, iterator, Leaf, Leaves, objectorientation, Postfix, Prefix | |||||||||