二叉树的前中后序遍历之递归与迭代解法

# 前序遍历之递归
class Solution:
    def preorderTraversal(self, root: TreeNode) -> List[int]:
        if not root:
            return []
        res = []
        def func(root):
            if not root:
                return
            res.append(root.val)
            func(root.left)
            func(root.right)
        func(root)
        return res
# 前序遍历之迭代
class Solution:
    def preorderTraversal(self, root: TreeNode) -> List[int]:
        if not root:
            return []
        stack = [root]
        res = []
        while stack:
            temp = stack.pop()
            res.append(temp.val)
            if temp.right:
                stack.append(temp.right)
            if temp.left:
                stack.append(temp.left)
        return res

# 中序遍历之递归
class Solution:
    def inorderTraversal(self, root: TreeNode) -> List[int]:
        if not root:
            return[]
        def func(root):
            if not root:
                return
            func(root.left)
            res.append(root.val)
            func(root.right)
        res = []
        func(root)
        return res
# 中序遍历之迭代
class Solution:
    def inorderTraversal(self, root: TreeNode) -> List[int]:
        if not root:
            return[]
        stack = []
        cur = root
        res = []
        while cur or stack:
            while cur:
                stack.append(cur)
                cur = cur.left
            temp = stack.pop()
            res.append(temp.val)
            if temp.right:
                cur = temp.right
        return res

# 后序遍历之递归
class Solution:
    def postorderTraversal(self, root: TreeNode) -> List[int]:
        if not root:
            return []
        res = []
        def func(root):
            if not root:
                return
            func(root.left)
            func(root.right)
            res.append(root.val)
        func(root)
        return res
# 后序遍历之迭代
class Solution:
    def postorderTraversal(self, root: TreeNode) -> List[int]:
        if not root:
            return []
        stack = [root]
        res = []
        while stack:
            temp = stack.pop()
            if temp.left:
                stack.append(temp.left)
            if temp.right:
                stack.append(temp.right)
            res.append(temp.val)
        return res[::-1]