目录
1.题目描述
2.代码实现
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {
if(root == null){
return true;
}
return isChildSymmetric(root.left,root.right);
}
public static boolean isChildSymmetric(TreeNode leftTree,TreeNode rightTree){
if(leftTree==null&&rightTree==null){
return true;
}
if((leftTree!=null&&rightTree==null)||(leftTree==null&&rightTree!=null)){
return false;
}
return (leftTree.val==rightTree.val)&&isChildSymmetric(leftTree.left,rightTree.right)
&&isChildSymmetric(leftTree.right,rightTree.left);
}
}