判定一棵二叉树是否是镜像的
方法一是采用递归的方法判定左右子树是否镜像值相等
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool checkSymmetric(TreeNode* l, TreeNode* r) {
if (!l && !r)
return true;
if (!l || !r)
return false;
return (l->val == r->val)&&checkSymmetric(l->left, r->right)&&checkSymmetric(l->right, r->left);
}
bool isSymmetric(TreeNode* root) {
return checkSymmetric(root, root);
}
};