Symmetric Tree - Recursion & Iteration

// my first implementation

// recursion

class Solution {
public:
    bool isSymmetric(TreeNode *root) {
        if (root == NULL) {
            return true;
        }
        
        return isMirror(root->left, root->right);
        
    }
    
    bool isMirror(TreeNode *r1, TreeNode *r2) {
        if (r1 == NULL) {
            return r2 == NULL;
        }
        
        if (r2 == NULL) {
            return r1 == NULL;
        }
        
        if (r1->val != r2->val) {
            return false;
        }
        
        return isMirror(r1->left, r2->right) && isMirror(r1->right, r2->left);
    }
    
};

</pre><pre name="code" class="cpp">//iteration

class Solution {
public:
    bool isSymmetric(TreeNode *root) {
        
        if (root == NULL) {
            return true;
        }
        
        std::queue<TreeNode*> q;
        q.push(root);
        size_t numNodes = 1;
        std::vector<TreeNode*> vec;
        
        while(!q.empty()) {
            vec.clear();
            size_t nullNum = 0;
            
            for (size_t i = 0; i<numNodes; i++) {
                TreeNode* node = q.front();
                q.pop();
                vec.push_back(node);
                if (node) {
                    q.push(node->left);
                    q.push(node->right);
                } else {
                    nullNum++;
                }
            }
            
            if (!isSymmetricLevel(vec)) {
                return false;
            } else {
                numNodes = 2*(numNodes-nullNum);
            }
        }
        
        return true;
    }
    
    bool isSymmetricLevel(const std::vector<TreeNode*>& levelNodes) {
        for (int i=0, j=levelNodes.size()-1; i<=j; i++, j--) {
            
            if (levelNodes[i] == NULL) {
                if (levelNodes[j] != NULL) {
                    return false;
                } else {
                    continue;
                }
            }
            
            if (levelNodes[j] == NULL) {
                if (levelNodes[i] != NULL) {
                    return false;
                } else {
                    continue;
                }
            }
            
            if (levelNodes[i]->val != levelNodes[j]->val) {
                return false;
            }
        }
        return true;
    }
};

second implementation