非递归,利用栈实现 public int[][] threeOrders(TreeNode root) { int[][] result = new int[3][]; result[0] = preSort(root); result[1] = inSort(root); result[2] = postSort(root); return result; } public int[] transformArr(List<Integer> list) { if (li...