import java.util.*; public class Solution { public int[] solve (int[] preOrder, int[] inOrder) { //层次遍历输出最右边元素 if(preOrder.length <= 1) return preOrder; Queue<TreeNode> queue = new LinkedList<>(); List<Integer> list = new LinkedList<>();...