Leetcode - 144. Binary Tree Preorder Traversal (层次遍历)

Given a binary tree, return the preorder traversal of its nodes' values.

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [1,2,3]

Follow up: Recursive solution is trivial, could you do it iteratively?

def preOrderTraversal(self,root):
    
    # 递归
    res = []
    def dfs(self,root):
        if not root:
            return

        res.append(root.val)
        dfs(root.left)
        dfs(root.right)

    dfs(root)

    return res

    # 非递归

    stack = [root]
    res = []

    while stack:
        node = stack.pop()
        res.append(node.val)
        if node.right:
            stack.append(node.right)
        if node.left:
            stack.append(node.left)
       
    return res