101. 对称二叉树

#include <iostream>
#include <algorithm>
#include "string"
#include "vector"
#include "stack"
#include "set"
using namespace std;


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

bool isMirror(TreeNode* root1, TreeNode* root2)
{
	if (root1 == NULL&&root2 == NULL) return true;
	if (root1 == NULL||root2 == NULL) return false;
	return   (root1->val == root2->val) &&isMirror(root1->left, root2->right) && isMirror(root1->right, root2->left);
}
bool isSymmetric(TreeNode* root) 
{
	return isMirror(root, root);
}

int main()
{
	    TreeNode t1 = TreeNode(1);
		TreeNode t2 = TreeNode(2);
		TreeNode t3 = TreeNode(2);
		TreeNode t4 = TreeNode(3);
		TreeNode t5 = TreeNode(4);
		TreeNode t6 = TreeNode(4);
		TreeNode t7 = TreeNode(3);
		t1.left = &t2; t1.right = &t3;
		t2.left = &t4; t2.right = &t5;
		t3.left = &t6; t3.right = &t7;
		
		cout << isSymmetric(&t1);
	
	
	system("pause");
	return 0;
}