前中后序遍历非递归写法

前序遍历

# 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: TreeNode) -> List[int]:
        res=[]
        stack=[]
        '''由于是先遍历根节点然后左子树然后右子树。所以要先访问根节点，然后用栈先进右子树。左边已经遍历完了，然后让最后进入的右子树出栈继续遍历'''
        while(root or len(stack)):
            while(root):
                res.append(root.val)
                stack.append(root.right)
                root=root.left
            root=stack.pop()
        return res
            
前序遍历右子树入栈

中序遍历

class Solution:
    
    def inorderTraversal(self, root: TreeNode) -> List[int]:
        ans=[]
        stack=[]
        '''由于是先左再中再右，就应该先让左子树不断入栈 然后出来一个没有左节点的根节点，然后遍历右节点。'''  
        while len(stack)!=0 or root:
            while(root):                
                stack.append(root)
                root=root.left
            root=stack.pop()           
            ans.append(root.val)
            if root.right:           
            	root=root.right
            else:
            	root=None
        return ans
中序中间弄完弄右边

后序遍历

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

class Solution:
    def postorderTraversal(self, root: TreeNode) -> List[int]:
        stack=[]
        res=[]
        '''先左子树，然后右子树，然后根节点，先把左子树入栈，然后只要右子树为空或者右子树已经遍历过，那么就访问出栈。然后遍历右子树。'''
        while(root or len(stack)):
            while(root):
                stack.append(root)
                root=root.left
            while (len(stack) and (stack[-1].right==None or stack[-1].right in res)):
                res.append(stack.pop())
            if len(stack):
                root=stack[-1].right
后序遍历右子树弄完弄中间


        return [i.val for i in res]