Binary tree traversal operations.

bin_tree_ops.py

tree_walk(x):
    if x:
        tree_walk(x:left)
        print x:key
        tree_walk(x:right)


tree_search(x, k):
    """Recursive search."""
    if not x or k == x.key:
        return x
    if k < x.key
        return tree_search(x.left, k)
    else
        return tree_search(x.right, k)


tree_search_i(x, k):
    """"Iterative search."""
    while x and k != x.key
        if k < x:key
            x = x:left
        else
            x = x:right
    return x


tree_min(x):
    while x.left:
        x = x.left
    return x


tree_max(x):
    while x.right:
        x = x.right
    return x