[leetcode]Symmetric Tree

题目来源：https://leetcode.com/problems/symmetric-tree/

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree is symmetric:

    1
   / \
  2   2
 / \ / \
3  4 4  3

But the following is not:

    1
   / \
  2   2
   \   \
   3    3

Note:
Bonus points if you could solve it both recursively and iteratively.

/**
 * Definition for a binary tree node.
 * 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 || (!root->left && !root->right)) return true;
        bool result = root->left && root->right;
        if(result) {
            result = recuCheck(root->left, root->right);
        } 
        return result;
    }
    bool recuCheck(TreeNode* t1, TreeNode* t2) {
        if(t1->val != t2->val) return false;
        if(t1->left&&!t2->right || !t1->left&& t2->right || t1->right&&!t2->left || !t1->right&&t2->left) 
            return false;
        bool result = true;
        if(t1->left) result = recuCheck(t1->left, t2->right);
        if(result && t1->right) result = recuCheck(t1->right, t2->left);
        return result;
        
    }
};