【LeetCode102】二叉树的层序遍历

题目描述：

首刷自解：

vector<vector<int>> levelOrder(TreeNode* root) {
    vector<vector<int>> ret;
    if (root == nullptr) return ret;
    queue<TreeNode*> que;
    TreeNode* node;
    que.push(root);
    int que_size=0;
    while (!que.empty())
    {
        que_size = que.size();
        ret.push_back(vector <int>());
        for (int i = 0; i < que_size; ++i)
        {
            node = que.front();
            ret.back().emplace_back(node->val);
            if (node->left != nullptr) que.push(node->left);
            if (node->right != nullptr) que.push(node->right);
            que.pop();
        }
    }
    return ret;
}