力扣-剑指 Offer 55 - I. 二叉树的深度（C++）- bfs

题目链接：https://leetcode-cn.com/problems/er-cha-shu-de-shen-du-lcof/
题目如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
        int result=0;
        if(root==NULL) return result;

        queue<TreeNode*> que;
        que.push(root);

        while(!que.empty()){
            int size=que.size();

            result++;
            while(size--){
                TreeNode* temp=que.front();
                que.pop();
                
                if(temp->left!=NULL) que.push(temp->left);
                if(temp->right!=NULL) que.push(temp->right);
            }
        }

        return result;
    }
};