Symmetric Tree(待测试)

/**
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(!root) return true;
        return subSolve(root->left,root->right);
    }
    bool subSolve(TreeNode* left,TreeNode* right)
    {
        if(!left&&!right) return true;
        if((!left&&right)||(left&&!right)) return false;
        if(left->val!=right->val)
            return false;
        else
            return subSolve(left->left,right->right)&&subSolve(left->right,right->left);
    }
};

解法2，使用队列结构

bool isSymmetric(TreeNode *root) {
    if(root == NULL) return true;

    queue<TreeNode *> lf, rt;
    lf.push(root->left);
    rt.push(root->right);
    TreeNode *l, *r;
    while(!lf.empty() && !rt.empty()) {
        l = lf.front(); r = rt.front();
        lf.pop(); rt.pop();
        if(l == NULL && r == NULL) continue;
        if(l == NULL || r == NULL) return false;
        if(l->val != r->val) return false;
        lf.push(l->left); lf.push(l->right);
        rt.push(r->right); rt.push(r->left);
    }
    if(lf.empty() && rt.empty()) return true;
    else return false;
}