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思路:判断一棵树是否为对称树,中序遍历和反中序遍历(先右再根再左),判断即可。
代码如下:
/**
* 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 isSymmetric(TreeNode root) {
if(root == null || (root.left == null && root.right == null)){
return true;
}
return isEquals(root.left, root.right);
}
/**
* 中序遍历的思想,只不过左子树是左根右,右子树是右根左
* 如果均相等返回true,否则为false
*/
private boolean isEquals(TreeNode p, TreeNode q){
if(p == null && q == null){
return true;
}
if(p != null && q != null){
return p.val == q.val && isEquals(p.left, q.right) && isEquals(p.right, q.left);
}
return false;
}
}