题解 | #二叉树的深度#

1. 采用队列进行处理

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

2.记录层数

        while (!que.empty()) {
            int size = que.size();
            depth++;
            for (int i = 0; i < size; i++) {
                TreeNode* node = que.front();
                que.pop();
                if (node->left) que.push(node->left);
                if (node->right) que.push(node->right);   
            }
        }