剑指 Offer 32 - II. 从上到下打印二叉树 II

要求：层序遍历
思路：

/**
 * 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>> v;
    void dfs(TreeNode* root,int level){
        if(!root)return;
        if(level<v.size())v[level].push_back(root->val);
        else v.push_back({root->val});
        dfs(root->left,level+1);
        dfs(root->right,level+1);
    }
    vector<vector<int>> levelOrder(TreeNode* root) {
        dfs(root,0);
        return v;
    }
};