/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSymmetric(TreeNode *root) {
if(root == NULL){
return true;
}
else return compareNodes(root->left, root->right);
}
bool compareNodes(TreeNode *leftNode, TreeNode *rightNode){
if(leftNode == NULL || rightNode == NULL){
if(leftNode == NULL && rightNode == NULL){
return true;
}
else return false;
}
else if(leftNode->val != rightNode->val) return false;
else return compareNodes(leftNode->left, rightNode->right)&&compareNodes(leftNode->right, rightNode->left);
}
};
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSymmetric(TreeNode *root) {
if(root == NULL){
return true;
}
else return compareNodes(root->left, root->right);
}
bool compareNodes(TreeNode *leftNode, TreeNode *rightNode){
if(leftNode == NULL || rightNode == NULL){
if(leftNode == NULL && rightNode == NULL){
return true;
}
else return false;
}
else if(leftNode->val != rightNode->val) return false;
else return compareNodes(leftNode->left, rightNode->right)&&compareNodes(leftNode->right, rightNode->left);
}
};