Binary Tree Preorder Traversal

题目描述

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

For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3

return [1,2,3].

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

思路

树的先序遍历，最简答的方法可以用递归。题目让最好别用递归。所以又写了DFS的方法。也比较简单。注意考虑空树的情况。

代码(Python)

递归方法：

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

class Solution:
    # @param root, a tree node
    # @return a list of integers
    def preorderTraversal(self, root):
        ans = []
        if root is None:
            return []
        ans+= [root.val]
        if root.left is not None:
            ans+=self.preorderTraversal(root.left)
        if root.right is not None:
            ans+=self.preorderTraversal(root.right)
        return ans

DFS方法：

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

class Solution:
    # @param root, a tree node
    # @return a list of integers
    def preorderTraversal(self, root):
        dfs = []
        ans = []
        if root is not None:
            dfs.append(root)
        while dfs != []:
            node = dfs.pop()
            ans.append(node.val)
            if node.right is not None:
                dfs.append(node.right)
            if node.left is not None:
                dfs.append(node.left)
        return ans