finding node in a tree

#this import is only needed for 2.2
from __future__ import generators

class Node:
    def __init__(self, name, *nodes):
        self.name = name
        self.children = list(nodes)
        
    def addChild(self, kid):
        self.children.append(nodes)
        
    def __iter__(self):
        yield self
        for child in self.children:
            for node in child:
                yield node

    def __eq__(self, name):
        return self.name == name


if __name__ == '__main__':
    #create some sample data
    a = Node('a')
    b = Node('b')
    c = Node('c', a, b)
    d = Node('d', c)
    e = Node('e')
    f = Node('f')
    g = Node('g', d, e, f)
    h = Node('h')
    i = Node('i', g, h)
    j = Node('j', i)
    k = Node('k')
    l = Node('l', k, j)
    root = Node('root', l)

    #print out the nodes (depth first)
    for node in root: print node.name,
    print
    #test for node with the given name
    print 'x' in root
    print 'i' in root

E:\prj\sandbox>python test2.py
root l k j i g d c a b e f h
False
True