binary-tree-preorder-traversal java code

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?

Idea: using recursion, backtracking to store the preorder traversal of the tree into the array and return it.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import java.util.ArrayList;
public class Solution {
    public ArrayList<Integer> preorderTraversal(TreeNode root) {
        ArrayList<Integer> list = new ArrayList<Integer>();
        if(root == null){
            return list;
        }
        test(root,list);
        return list;
    }

    public void test(TreeNode node,ArrayList<Integer> list){
        list.add(node.val);
        if(node.left != null){
            test(node.left,list);
        }
        if(node.right != null){
            test(node.right,list);
        }
    }
}