给定一个二叉树,检查它是否是镜像对称的。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
bool Symmetric(struct TreeNode* left, struct TreeNode* right) {
if (left == NULL && right == NULL) {
return true;
}
else if (left == NULL || right == NULL) {
return false;
}
else if (left->val != right->val) {
return false;
}
else {
return Symmetric(left->left, right->right) && Symmetric(left->right, right->left);
}
}
bool isSymmetric(struct TreeNode* root) {
if (root == NULL) {
return true;
}
else if (root->left == NULL && root->right == NULL) {
return true;
}
else if (root->left == NULL || root->right == NULL) {
return false;
}
else {
return Symmetric(root,root);
}
}