二叉树

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

# 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)