二叉树用栈实现前序中序后序--python

# Definition for a binary tree node.
class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

class Solution:
    def preorderTraversal(self, root):
        """
        前序遍历，先遍历根节点，如果右子树存在把右子树根节点放入栈，最后把左子树放入栈
        """
        result = []
        if root == None:
            return result
        nodeStack = []
        nodeStack.append(root)
        while len(nodeStack) !=0 :
            node = nodeStack.pop()
            result.append(node.val)
            if node.right != None:
                nodeStack.append(node.right)
            if node.left != None:
                nodeStack.append(node.left)

        return result

    def inorderTraversal(self, root):
        '''
        中序遍历，寻找左子树为空的节点遍历的节点都入栈，直到左子树是叶子节点，
        节点出栈，并访问该节点的右子树如果存在入栈，并寻找该节点的左子树，如果
        不存在左子树，栈顶元素出栈
        '''
        res = []  ##存放节点的值 
        stack = [] ###存放节点
        while root or stack:
            if root:
                stack.append(root)
                root = root.left
            else:
                root = stack.pop()
                res.append(root.val)
                root = root.right
        return res
    
    
   '''
   后序遍历可以是根右左生成序列的倒序排序
   '''
   def postorderTraversal(self, root):
        result = []
        if root == None:
            return result
        nodeStack = []
        nodeStack.append(root)
        while len(nodeStack) != 0:
            node = nodeStack.pop()
            result.append(node.val)

            if node.left != None:
                nodeStack.append(node.left)
            if node.right != None:
                nodeStack.append(node.right)

        print(result[::-1])
        return result[::-1]  # 反转后就是左右根