题目描述:
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
For example, this binary tree is symmetric:
1
/ \
2 2
/ \ / \
3 4 4 3
But the following is not:
1 / \ 2 2 \ \ 3 3
题目大意是:给出一个二叉树 判断是否对称。
解题思路:
1.首先处理特殊情况:空树和只有根节点的树是对称的;
如果只有左子树或右子树 就不是对称的;
2.递归判断左右子树,如果左右子树值相等,则左子树的左节点值等于右子树的右节点;或者左子树的右结点等于右子树的左节点的值 则为对称树。
代码实现:
/**
* 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 symmetric(TreeNode root1 , TreeNode root2){
if(root1 == null && root2 == null)
return true;
if(root1 == null || root2 == null)
return false;
if(root1.val == root2.val)
return symmetric(root1.left,root2.right) && symmetric(root1.right,root2.left);
else
return false;
}
public boolean isSymmetric(TreeNode root) {
if(root == null)
return true;
return symmetric(root.left,root.right);
}
}