根据二叉树前序和中序结果建立二叉树，并输出右视图

题目描述

请根据二叉树的前序遍历，中序遍历恢复二叉树，并打印出二叉树的右视图

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     * 求二叉树的右视图
     * @param xianxu int整型一维数组 先序遍历
     * @param zhongxu int整型一维数组 中序遍历
     * @return int整型一维数组
     */
    
    public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;
        TreeNode(int value) {
            this.val = value;
        }
    }
    public int[] solve (int[] xianxu, int[] zhongxu) {
        // write code here
        int len = xianxu.length;
        TreeNode root = buildTree(xianxu, 0, len - 1, zhongxu, 0, len - 1);
        Queue<TreeNode> queue = new LinkedList<>();
        ArrayList<Integer> res = new ArrayList<>();
        queue.add(root);
        while (! queue.isEmpty()) {
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                if (i == size - 1) {
                    res.add(node.val);
                }
                if (node.left != null) queue.add(node.left);
                if (node.right != null) queue.add(node.right);
            }
        }
        int[] list = new int[res.size()];
        for (int i = 0; i < res.size(); i++) {
            list[i] = res.get(i);
        }
        return list;
    }
    
    private TreeNode buildTree(int[] xianxu, int startOfPre, int endOfPre, int[] zhongxu, int startOfIn, int endOfIn) {
        if (startOfPre > endOfPre || startOfIn > endOfIn) return null;
        TreeNode root = new TreeNode(xianxu[startOfPre]);
        int index = startOfIn;
        while (index <= endOfIn && zhongxu[index] != xianxu[startOfPre]) {
            index++;
        }
        root.left = buildTree(xianxu, startOfPre + 1, startOfPre + index - startOfIn, zhongxu, startOfIn, index - 1);
        root.right = buildTree(xianxu, startOfPre + index - startOfIn + 1, endOfPre, zhongxu, index + 1, endOfIn);
        return root;
    }
}