建立二叉树（非二叉搜索树）

class TreeNode(object):
    def __init__(self,item=None,left=None,right=None):
        self.item = item
        self.left = left
        self.right = right

class BinaryTree(object): # 创建二叉树
    def __init__(self):
        self.root = None # 根结点

    def add(self, val):  # 二叉树添加结点
        node = TreeNode(val)
        if self.root is None:
            self.root = node
            return
        queue = [self.root]
        while queue:
            temp_node = queue.pop(0)
            if temp_node.left is None:
                temp_node.left = node
                return
            else:
                queue.append(temp_node.left)
            if temp_node.right is None:
                temp_node.right = node
                return
            else:
                queue.append(temp_node.right)

    def pre_order(self, node):
        if node is None:
            return
        stack = []
        temp_node = node
        while temp_node or stack:
            while temp_node:
                print(temp_node.val, end=" ")
                stack.append(temp_node)
                temp_node = temp_node.left
            node = stack.pop()
            temp_node = node.right

    def in_order(self, node):
        if node is None:
            return
        stack = []
        temp_node = node
        while temp_node or stack:
            while temp_node:
                stack.append(temp_node)
                temp_node = temp_node.left
            node = stack.pop()
            print(node.item, end=" ")
            temp_node = node.right

    def post_order(self, node):  # 二叉树的后序遍历（非递归)
        if node is None:
            return None
        stack = []
        temp_node = node
        while temp_node or stack:
            while temp_node:
                stack.append(temp_node)
                temp_node = temp_node.left
            left_node = stack[-1]
            temp_node = left_node.right
            if temp_node is None:
                node = stack.pop()
                print(node.val, end=" ")
                while stack and node == stack[-1].right:
                    node = stack.pop()
                    print(node.val, end=" ")


if __name__ == '__main__':
    t = BinaryTree()
    node = [4,5,8,6,7,6,5,7]
    for i in node:
        t.add(i)
    t.in_order(t.root)