二叉树

# coding:utf-8

#创建树结构
class TreeNode:
    def __init__(self, value):
        self.value = value
        self.children = []

    def add_child(self, child):
        self.children.append(child)

#递归遍历树
def traverse_tree(node):
    if node is None:
        return

    for child in node.children:
        traverse_tree(child)
    print(node.value)

if __name__ == "__main__":
    root = TreeNode("root")
    node2 = TreeNode('node2')
    node3 = TreeNode('node3')
    node4 = TreeNode('node4')

    root.add_child(node2)
    root.add_child(node3)
    node2.add_child(node4)

    traverse_tree(root)