public static class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } public boolean isSymmetric(TreeNode root) { if (root==null) { return true; } else { return isSymmetric(root.left,root.right); } } private boolean isSymmetric(TreeNode p,TreeNode q) { if(p==null&&q==null) { return true; } if (p==null||q==null) { return false; } return p.val==q.val&&isSymmetric(p.right,q.left)&&isSymmetric(p.left,q.right); }
leetcode101 Java
最新推荐文章于 2022-04-20 22:55:46 发布