leetcode102. 二叉树的层序遍历

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

示例 1：
输入：root = [3,9,20,null,null,15,7]
输出：[[3],[9,20],[15,7]]
示例 2：

输入：root = [1]
输出：[[1]]
示例 3：

输入：root = []
输出：[]

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

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) {
            return res;
        }
        
        vector<int> tmp;
        queue<TreeNode *> _queue;
        _queue.push(root);
        int n;
        while(! _queue.empty()){
            n = _queue.size();
            for(int i=0;i<n;i++){
                tmp.push_back(_queue.front()->val);
                if(_queue.front()->left )_queue.push(_queue.front()->left );
                if(_queue.front()->right )_queue.push(_queue.front()->right );
                _queue.pop();
            }
            res.push_back(tmp);
            tmp.clear();
        }

        return res;
    }
};

int main()
{
    cout<<"Hello World";
    Solution mysolution;
    TreeNode* root = new TreeNode(3);
    root->left = new TreeNode(9);
    root->right = new TreeNode(20);

    root->right->left = new TreeNode(15);
    root->right->right = new TreeNode(7);

    vector<vector<int>> res = mysolution.levelOrder(root);


    // 输入：root = [3,9,20,null,null,15,7]
    // 输出：[[3],[9,20],[15,7]]



    return 0;
}