代码如下:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {
return check(root.left, root.right); // 左右结点
}
public boolean check(TreeNode left, TreeNode right)
{
if(left == null && right == null) // 只有一个根返回true
return true;
if(left == null || right == null) // 左或右只有一个节点不对称
return false;
if(left.val != right.val) // 根节点的左右节点不相等
return false;
//递归实现//根节点的左节点的左节点和右节点右节点, 左边的 右节点,和右边的左节点。
return check(left.left, right.right) && check(left.right, right.left);
}
}