144. 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?

public static List<Integer> preorderTraversal(TreeNode root) {
	List<Integer> res = new ArrayList<Integer>();
	if (root == null)
		return res;
	res.add(root.val);
	if (root.left != null) {
		res.addAll(preorderTraversal(root.left));
	}		
	if (root.right != null) {
		res.addAll(preorderTraversal(root.right));
	}
	return res;
}