int val;

TreeNode *left;

TreeNode *right;

TreeNode(int x) : val(x), left(NULL), right(NULL) {}

bool isSymmetric(TreeNode* root) {

if (root == NULL)

{

return true;

}

return isMirror(root -> left, root -> right);

}

bool isMirror(TreeNode *t1, TreeNode *t2)

{

if (t1 == NULL && t2 == NULL)

{

return true;

}

if (t1 == NULL || t2 == NULL)

{

return false;

}

return t1 -> val == t2 -> val && isMirror(t1 -> left, t2 -> right) && isMirror(t1 -> right, t2 -> left);

}

{

TreeNode *root = new TreeNode(1);

root -> left = new TreeNode(1);

root -> right = new TreeNode(1);

root -> left -> left = new TreeNode(1);

root -> left -> right = new TreeNode(0);

root -> right -> left = new TreeNode(0);

root -> right -> right = new TreeNode(1);

Solution s;

cout << s.isSymmetric(root) << endl;