二叉树的非递归后序遍历（python）

# 本代码包括建树过程
class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None
 # 建树
 def creatTree(data, index):
    pNode = None
    if index < len(data):
        if data[index] == '#':
            return
        pNode = TreeNode(data[index])
        pNode.left = creatTree(data, 2 * index + 1)
        pNode.right = creatTree(data, 2 * index + 2)
    return pNode
# 后序遍历
def postOrder(root):
    if not root:
        return []
    p = root
    stack, res = [root, ], []
    while stack:
        root = stack.pop()
        res.append(root.val)
        if root.left:
            stack.append(root.left)
        if root.right:
            stack.append(root.right)
    return res[::-1]    
    
data = [s for s in input().split(' ')]
root = creatTree(data, 0)
print(postOrder(root))

来源：https://blog.csdn.net/weixin_43204128/article/details/98980490