问leetcode中的二叉树层次顺序遍历

EN

#include<bits/stdc++.h>
using namespace std;

class Solution {
public:

    vector<vector<int>> levelOrder(TreeNode* root) {
        int d = height(root);
        vector<int> lol[d];
        vector<vector<int>> ans;
        queue<TreeNode*> q;
        if(root!=NULL)
            q.push(root);
        for(int i=0; i<=d;i++){
            ans.push_back(level(i,q,lol[i]));
        }
        return ans;
    }

    vector<int> level(int i,queue<TreeNode*> q,vector<int> lol){
        if (q.size() != 0)
        {
            for(int a=0;a<=i;a++){
                lol.push_back(q.front()->val);
                q.push(q.front()->left);
                q.push(q.front()->right);
                q.pop();
            }
        }
        return lol;
    }

    int height(TreeNode* root){
        if (root==NULL)
            return 0;
        else{
            int lef = height(root->left) + 1;
            int rig = height(root->right) + 1;
            if(lef>rig)
                return lef;
            else
                return rig;
        }
    }
};