bfsclass Solution {public: int countNodes(TreeNode* root) { int num=0; if(root==nullptr)return num; queue<TreeNode*>q;