LeetCode101.对称二叉树

给定一个二叉树，检查它是否是镜像对称的。

例如，二叉树 [1,2,2,3,4,4,3] 是对称的。

1

/ \

2 2

/ \ / \

3 4 4 3

二叉树[1,2,2,null,3,3,null,5,-2,-2,5]是对称的。

                    1

                /        \

              2           2

               \         /

                3      3

              /  \    /  \

            5  -2  -2  5

但是下面这个 [1,2,2,null,3,null,3] 则不是镜像对称的:

1

/ \

2 2

\ \

3 3

#include <iostream>
#include <queue>
#include<vector>
#include <cstdlib>
#include <cstring>
using namespace std;
struct TreeNode
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(NULL), right(NULL) {}
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};

class Solution{
	vector<int> vec;
public:
	bool isSymmetric(TreeNode *root) {
		if(!root) {
			return true;
		}
		return check(root->left,root->right);
	} 
	
	bool check(TreeNode *left,TreeNode *right) {
		if(left == NULL && right == NULL) {
			return true;
		}
		if(left == NULL || right == NULL || left->val != right->val) {
			return false;
		}
		return check(left->left,right->right) && check(left->right,right->left);
	}
};

TreeNode* inputTree()
{
    int n,count=0;
    char item[100];
    cin>>n;
    if (n==0)
        return NULL;
    cin>>item;
    TreeNode* root = new TreeNode(atoi(item));
    count++;
    queue<TreeNode*> nodeQueue;
    nodeQueue.push(root);
    while (count<n)
    {
        TreeNode* node = nodeQueue.front();
        nodeQueue.pop();
        cin>>item;
        count++;
        if (strcmp(item,"null")!=0)
        {
            int leftNumber = atoi(item);
            node->left = new TreeNode(leftNumber);
            nodeQueue.push(node->left);
        }
        if (count==n)
            break;
        cin>>item;
        count++;
        if (strcmp(item,"null")!=0)
        {
            int rightNumber = atoi(item);
            node->right = new TreeNode(rightNumber);
            nodeQueue.push(node->right);
        }
    }
    return root;
}

int main()
{
	TreeNode* root;
	root=inputTree();
	bool res=Solution().isSymmetric(root);
	cout<<(res?"true":"false");
	return 0; 
}