/** public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; } } */ // 时间复杂度:O(n^2), 空间复杂度:O(n) public class Solution { // 使用一个辅助函数,同时前序遍历两个子树 public boolean fororder(TreeNode root1,TreeNode root...