leetcode-144Binary Tree Preorder Traversal

链接:https://leetcode.com/problems/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?

Subscribe to see which companies asked this question
题目大意:比较简单就是一个先序遍历。
递归版本:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res=new ArrayList<Integer>();
        find(root,res);
        return res;
    }
    private void find(TreeNode root,List<Integer> res){
        if(root==null){
            return;
        }
        res.add(root.val);
        find(root.left,res);
        find(root.right,res);
    }
}

非递归版本利用栈来实现，也比较简单:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res=new ArrayList<Integer>();
           Stack<TreeNode> nodestack=new Stack<TreeNode>();
          if (root != null) {
               nodestack.push(root);
          }
           while (!nodestack.empty()) {
                TreeNode  tmpNode = nodestack.pop();
                res.add(tmpNode.val);
                if (tmpNode.right!=null) {
                    nodestack.push(tmpNode.right);
                 }
                if (tmpNode.left!=null) {
                     nodestack.push(tmpNode.left);
                }
          }
          return res;
    }

}