基础算法-Python遍历打印二叉树

【基础算法】-Python遍历打印二叉树 #!/usr/bin/python class TreeNode(): def __init__(self, val): self.val = val self.left = None self.right = None def list_create_tree(root_node, tree_nodes_val, i): if i < len(tree_nodes_val): if tree_nodes_val[i] == "#": return None else: root = TreeNode(tree_nodes_val[i]) root.left = list_create_tree(root.left, tree_nodes_val, 2 * i + 1)