Binärbaum - Das deutsche Python-Forum

(nervös im Sedgewick blätternd)

#!/usr/bin/env python

class Node :
    def __init__(self, value) :
        n = len(value)
        a = value[:n/2]
        b = value[n/2+1:]
        self.value = value[n/2]
        if len(a) :
            self.left = Node(a)
        else :
            self.left = None
        if len(b) :
            self.right = Node(b)
        else :
            self.right = None


    def inorder(self, func, depth = 1) :
        if self.left :
            self.left.inorder(func, depth+1)
        func(self.value, depth)
        if self.right :
            self.right.inorder(func, depth+1)

    def preorder(self, func, depth = 1) :
        func(self.value, depth)
        if self.left :
            self.left.preorder(func, depth+1)
        if self.right :
            self.right.preorder(func, depth+1)
        
    def postorder(self, func, depth = 1) :
        if self.left :
            self.left.postorder(func, depth+1)
        if self.right :
            self.right.postorder(func, depth+1)
        func(self.value, depth)

if __name__ == '__main__' :
    def out(x, depth):
        print "  "*depth, x
        
    a = [0,1,2,3,4,5,6,7,8,9]
    tree = Node(a)
    print "inorder:"
    tree.inorder(out)
    print "preorder:"
    tree.preorder(out)
    print "postorder:"
    tree.postorder(out)