101. Symmetric Tree

101. Symmetric Tree

class Solution {
public:
    bool isSymmetric(TreeNode* root) {
        if(root==NULL)
            return true;
        queue<TreeNode*> ql,qr;
        ql.push(root->left);
        qr.push(root->right);
        while(!ql.empty() && !qr.empty()){
            TreeNode* nodel=ql.front();
            ql.pop();
            TreeNode* noder=qr.front();
            qr.pop();
            if(nodel==NULL && noder==NULL)
                continue;
            if(nodel==NULL || noder==NULL)
                return false;
            if(nodel->val != noder->val)
                return false;
            ql.push(nodel->left);
            ql.push(nodel->right);
            qr.push(noder->right); //左右顺序！！！！
            qr.push(noder->left);
             
        }
        return true;

    }
};