LeetCode 102. 二叉树的层序遍历 & 107. 二叉树的层序遍历 II

题目：

https://leetcode.cn/problems/binary-tree-level-order-traversal/description/

https://leetcode.cn/problems/binary-tree-level-order-traversal-ii/description/

        给你二叉树的根节点 root ，

102：返回其节点值的 层序遍历 。（即逐层地，从左到右访问所有节点）。

107：返回其节点值 自底向上的层序遍历。（即按从叶子节点所在层到根节点所在的层，逐层从左向右遍历）

示例：

        输入：root = [3,9,20,null,null,15,7]
        102题 输出：[[3],[9,20],[15,7]]
        107题 输出：[[15,7],[9,20],[3]]

代码：【二叉树的层序遍历】

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    // 自顶向下
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> res;
        if (root == nullptr) {
            return res;
        }

        queue<TreeNode*> q;
        q.push(root);
        while (!q.empty()) {
            int curLevelSize = q.size();
            vector<int> curLevel;
            for (int i = 0; i < curLevelSize; i++) {
                auto curNode = q.front();
                q.pop();
                curLevel.push_back(curNode->val);
                if (curNode->left) {
                    q.push(curNode->left);
                }
                if (curNode->right) {
                    q.push(curNode->right);
                }
            }
            res.push_back(curLevel);
        }
        return res;
    }

    // 自底向上
    vector<vector<int>> levelOrderBottom(TreeNode* root) {
        auto res = levelOrder(root);
        reverse(res.begin(), res.end());
        return res;
    }
};