[Leetcode] Binary Tree Preorder Traversal (Java)

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?

非递归前序遍历

public class Solution {
    public ArrayList<Integer> preorderTraversal(TreeNode root) {
        ArrayList<Integer> ret = new ArrayList<Integer>();
		Stack<TreeNode> stack = new Stack<TreeNode>();
		if(root==null)
			return ret;
		stack.add(root);
		while(!stack.isEmpty()){
			TreeNode tmp = stack.peek();
			stack.pop();
			ret.add(tmp.val);
			if(tmp.right!=null)
				stack.add(tmp.right);
			if(tmp.left!=null)
				stack.add(tmp.left);
		}
		return ret;        
    }
}