Java -- 树的先序、中序、后序遍历

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 * }
 */

public class Solution {
    /**
     * 
     * @param root TreeNode类 the root of binary tree
     * @return int整型二维数组
     */
    private static ArrayList<Integer> first = new ArrayList<>();
    private static ArrayList<Integer> middle = new ArrayList<>();
    private static ArrayList<Integer> then = new ArrayList<>();
    
    private static void firstOrder(TreeNode root){
        if(root != null){
            first.add(root.val);
            firstOrder(root.left);
            firstOrder(root.right);
        }
    }
    
    private static void middleOrder(TreeNode root){
        if(root!=null){
            middleOrder(root.left);
            middle.add(root.val);
            middleOrder(root.right);
        }
    }
    
    private static void thenOrder(TreeNode root){
        if(root!=null){
            thenOrder(root.left);
            thenOrder(root.right);
            then.add(root.val);
        }
    }
    
    private static int[] toIntArray(ArrayList<Integer> arrayList){
        int[] intArray = arrayList.stream().mapToInt(Integer::valueOf).toArray();
        return intArray;
    }
    
    public int[][] threeOrders (TreeNode root) {
        // write code here
        int[][] orders= new int[3][];
        firstOrder(root);//调用先序方法
        orders[0] = toIntArray(first);//将先序遍历的结果放入二维数组中
        middleOrder(root);//调用中序方法
        orders[1] = toIntArray(middle);//将后序遍历
        thenOrder(root);
        orders[2] = toIntArray(then);
        return orders;
    }
}

int[] intArray = arrayList.stream().mapToInt(Integer::valueOf).toArray();的解析
https://blog.csdn.net/weixin_49428831/article/details/120732178