LEETCODE--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,#,#,15,7},

3

/ \
9 20
/ \
15 7

return its level order traversal as:

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

confused what “{1,#,2,3}” means? > read more on how binary tree is serialized on OJ.

/**
 * 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>> finsh;
    void levelsort(TreeNode* root, int level){
        if(!root)
          return ;
        if(level == finsh.size())
         {
            vector<int> add;
            finsh.push_back(add);
         }
        finsh[level].push_back(root->val);
        levelsort(root->left, level+1);
        levelsort(root->right, level+1);
    }

    vector<vector<int>> levelOrder(TreeNode* root) {
        levelsort(root, 0);
        return finsh;
    }
};