leetcode question 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]
]

分析：

这道题叫我们分层输出，最后输出一个vector，乍看上去，就感觉和BFS（宽度优先遍历）差不多。差别就是这里要分层输出，BFS的不需要区分前后两个节点是否是同一层，这里需要判断。因此就不能用队列了。我这里改用了两个vector，每个vector装一层的节点。下面上代码：

/**
 * 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) {
        vector<vector<int>> ans;
        
        if( root == NULL ){
            return ans;
        }
        
        vector<TreeNode*> one;
        
        
        one.push_back( root );
        
        while( !one.empty() ){
            vector<int> nums;
            vector<TreeNode*> two;
            
            for( int i = 0 ; i < one.size() ; i++ ){
                nums.push_back(one[i]->val);
                
                if( one[i] -> left != NULL ){
                    two.push_back(one[i]->left);
                }
                if(one[i] -> right != NULL ){
                    two.push_back(one[i]->right);
                }
            }
            ans.push_back(nums);
            one = two;
        }
        
        return ans;
    }
};