代码没什么好解释的,一看就懂的代码~ 递归 import java.util.*; public class Solution { public boolean isSymmetric (TreeNode root) { if(root == null) return true; return check(root.left,root.right); } public boolean check(TreeNode left, TreeNode right){ if(left == null && right == null) return true; if(left == nu...