题解 | #二叉树的前序遍历#

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @return int整型一维数组
     */
    public int[] preorderTraversal (TreeNode root) {
        // write code here
        if(root == null) {
            return new int[]{};
        }
        List<Integer> list = new ArrayList<>();        
        visit(root, list);
        return list.stream().mapToInt(Integer::intValue).toArray();
    }

    public void visit(TreeNode node, List<Integer> list) {
        if(node == null) {
            return;
        }
        list.add(node.val);
        visit(node.left, list);
        visit(node.right, list);
    }


}