class Solution {
public:
int maxDepth(TreeNode* root) {
if(root==nullptr)return 0;
queue<TreeNode*>q;
q.push(root);
int ans=0;
while(!q.empty()){
int t=q.size();//每层的节点数
while(t--){
TreeNode* node=q.front();
q.pop();
if(node->left)q.push(node->left);
if(node->right)q.push(node->right);
}
//一层的节点数结束后,深度加1
ans++;
}
return ans;
}
};