给你一个二叉树的根节点 root
, 检查它是否轴对称
如果一个树的左子树与右子树镜像对称,那么这个树是对称的,
两个树互为镜像:
- 它们的两个根结点具有相同的值
- 每个树的右子树都与另一个树的左子树镜像对称
较为容易想到的是用递归去判断每一个节点
bool isSameTree(struct TreeNode* p, struct TreeNode* q) {
if((!p && !q))
{
return true;
}
if((p && q) && (p->val == q->val))
{
return isSameTree(p->left, q->right) * isSameTree(p->right, q->left);
}
else
{
return false;
}
}
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
bool isSymmetric(struct TreeNode* root) {
if(!root || (!root->left && !root->right))
{
return true;
}
if(root->left && root->right)
{
return isSameTree(root->left, root->right);
}
else
{
return false;
}
}
给出Java的写法
/**
* 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,root);
}
public boolean check(TreeNode p, TreeNode q)
{
if(p==null&&q==null)return true;
if(p==null||q==null)return false;
return p.val==q.val&&check(p.left,q.right)&&check(p.right,q.left);
}
}