Python构建二叉树四种遍历方式包括层序遍历

    class TreeNode(object):
    def __init__(self, data=None, left=None, right=None):
        self.data = data
        self.left = left
        self.right = right
    
    
    class BinaryTree(object):
    def __init__(self, data_list):
        self.it = iter(data_list)
        self.root = TreeNode()
        self.create_tree()
    
    def inorder_create(self, bt=None):
        try:
            data = next(self.it)
            if data == '#': bt = None
            else:
                bt = TreeNode(data)
                bt.left = self.