二叉树的前序遍历

给出一棵二叉树，返回其节点值的前序遍历。
给出一棵二叉树 {1,#,2,3},

1
\
2
/
3
返回 [1,2,3].

树的深度低,用递归方式非常简单,
用栈来模拟递归也是一样

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: Preorder in ArrayList which contains node values.
     */
    public ArrayList<Integer> preorderTraversal(TreeNode root) {
        // write your code here
        ArrayList<Integer> R = new ArrayList<Integer>();
        preorder(root, R);

        return R;
    }

    public int preorder(TreeNode root, ArrayList result)
    {

        if(root != null)
            result.add(root.val);
        else
            return 0;

        preorder(root.left, result);
        preorder(root.right, result);

        return 0;
    }
}