题目:
leetcode 链接
思路:分别判断对称位置的值是否相同,即根节点的左子树的左节点和右子树的右节点 与 左子树的右节点和右子树的左节点是否都相同。并依次按左子树的左节点和右子树的右节点 左子树的右节点和右子树的左节点深入比较下去。
递归代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isSymmetric(TreeNode root) {
if (root ==null){
return true;
}
return isSubTreeSymmetric(root.left, root.right);
}
public boolean isSubTreeSymmetric(TreeNode left, TreeNode right){
if(left ==null && right ==null) return true;
if(left==null || right ==null) return false;
if(left.val == right.val ) {
return isSubTreeSymmetric(left.left, right.right) && isSubTreeSymmetric(left.right, right.left);
}
else{
return false;
}
}
}