Leetcode 102. Binary Tree Level Order Traversal

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).

For example:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

s思路：
1. 遍历。看到一层一层的分割，那就自然想到了queue，想到了bfs.
2. 没什么说的，比较简单粗暴！

//方法１：bfs=queue
class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        //
        vector<vector<int>> res;
        if(!root) return res;
        queue<TreeNode*> qq;
        qq.push(root);
        while(!qq.empty()){
            int qsize=qq.size();
            TreeNode* cur_q;
            vector<int> level;
            for(int i=0;i<qsize;i++){
                cur_q=qq.front();
                qq.pop();
                if(cur_q) {
                    level.push_back(cur_q->val);
                    if(cur_q->left) qq.push(cur_q->left);
                    if(cur_q->right) qq.push(cur_q->right);
                }
            }
            res.push_back(level);   
        }
        return res;
    }
};
//方法１：优化了一下，每一层的vector的长度就等于queue的大小，所以不用每次push_back添加数到vector,而直接用[i]来写入数据！
class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        //
        vector<vector<int>> res;
        if(!root) return res;
        queue<TreeNode*> qq;
        qq.push(root);
        while(!qq.empty()){
            int qsize=qq.size();
            TreeNode* cur_q;
            vector<int> level(qsize);
            for(int i=0;i<qsize;i++){
                cur_q=qq.front();
                qq.pop();
                level[i]=cur_q->val;
                if(cur_q->left) qq.push(cur_q->left);
                if(cur_q->right) qq.push(cur_q->right);
            }
            res.push_back(level);   
        }
        return res;
    }
};