102. Binary Tree Level Order Traversal

简单题 bfs搞定

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        queue<TreeNode*>qu;
        vector<vector<int>>ve;
        if(root == NULL) return ve;
        vector<int>vec;
        int num = 1;
        qu.push(root);
        while(!qu.empty()){
            TreeNode* t;
            vec.clear();
            int nn = num;
            num = 0;
            for(int i = 1; i <= nn; ++ i){
                t = qu.front(); qu.pop();
                vec.push_back(t -> val);
                if(t -> left != NULL){
                    num++;
                    qu.push(t -> left);
                }
                if(t -> right != NULL){
                    num++;
                    qu.push(t -> right);
                }
            }
            ve.push_back(vec);
        }
        return ve;
    }
};