题目:
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
分析:
判断一棵树是否是对称的,需要判断这棵树的子树是否为对称的,用递归去解决比较容易。具体就是写一个check函数,这个函数传入两棵树,返回这两棵树是否对称,子函数中的判断条件是如果两棵树都为空,那么对称;如果一棵树为空,另一颗树不为空,那么不对称;当都不为空时,递归判断根节点是否相同,第一颗树的左孩子和第二棵树的右孩子是否相同,第一颗树的右孩子和第二棵树的左孩子是否相同。当所有条件都满足,那么这棵树就是对称的。
具体代码如下:
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isSymmetric(TreeNode root) {
return check(root, root);
}
public boolean check(TreeNode left, TreeNode right){
if (left == null && right == null)
return true;
if ((left == null && right != null) || (right == null && left != null))
return false;
return (left.val == right.val) && check(left.left, right.right) && check(left.right, right.left);
}
}