Leetcode102. 二叉树的层序遍历 -hot100-代码随想录

题目：

---

代码(首刷看解析 2024年1月24日）：

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> res;
        if(root == nullptr) return res;
        queue<TreeNode*> que;
        TreeNode* cur = root;
        que.push(cur);
        int size = 0;
        while (!que.empty()) {
            size = que.size();
            vector<int> vec;
            while (size--) {
                TreeNode* node = que.front();
                vec.emplace_back(node->val);
                que.pop();
                if(node->left) que.push(node->left);
                if(node->right) que.push(node->right);
            }
            res.emplace_back(vec);
        }
        return res;
    }
};

---

代码（二刷自解 2024年3月6日）

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> res;
        if (!root) return res;
        queue<TreeNode*> q;
        TreeNode* cur = root;
        q.push(cur);
        while (!q.empty()) {
            int size = q.size();
            vector<int> path;
            while (size--) {
                TreeNode* node = q.front();
                q.pop();
                path.emplace_back(node->val);
                if (node->left) q.push(node->left);
                if (node->right) q.push(node->right);
            }
            res.push_back(path);
        }
        return res;
    }
};