101. 对称二叉树:
题目链接 :101. 对称二叉树
题目:
给定一个二叉树,检查它是否是镜像对称的。
思路:
1、
递归:
-
对当前节点的左右子树判断
-
对其左右子树的左右子树分别进行交替判断,即n1的左子树和n2的右子树判断,反之亦然。
AC代码:
/**
* 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) {
if(root==null)
{
return true;
}
return cmp(root.left,root.right);
}
boolean cmp(TreeNode n1,TreeNode n2)
{
if(n1==null&&n2==null)
{
return true;
}
if(n1==null||n2==null||n1.val!=n2.val)
{
return false;
}
return cmp(n1.left,n2.right)&&cmp(n2.left,n1.right);
}
}