LeetCode222.完全二叉树的节点个数

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int countNodes(TreeNode* root) 
    {
        deque<TreeNode*> queue;
        int count = 0;
        if (root == nullptr) return count;
        queue.push_back(root);
        
        while (!queue.empty())
        {
            TreeNode* cur = queue.front();
            queue.pop_front();
            count++;

            if (cur->left != nullptr) queue.push_back(cur->left);
            if (cur->right != nullptr) queue.push_back(cur->right);
        }
        return count;
    }
};