二叉树层序遍历，菜bird考研记录

class Solution {

public:

    vector<vector<int>> levelOrder(TreeNode* root) {

    queue<TreeNode*> que;

    vector<vector<int>>result;

    TreeNode * p;

    if(root==NULL) return result;

    que.push(root);

    while(!que.empty())

    {

    int size=que.size();

    vector<int>v1;

    for(int i=0;i<size;i++)

    {p=que.front();

    v1.push_back(p->val);

    que.pop();

    if(p->left) que.push(p->left);

    if(p->right) que.push(p->right);

    }

    result.push_back(v1);

    }

    return result;

    }

};