例如:
3 / \ 9 20 / \ 15 7 返回:按层遍历[[15,7] [9,20],[3],]
[
[15,7]
[9,20],
[3],
]
vector<vector<int> > levelOrderBottom(TreeNode *root) {
vector<vector<int>> result;
if(root==NULL)
return result;
queue<TreeNode*> que;
int currentCount=1;
int nextCount=0;
que.push(root);
vector<int> path;
while(!que.empty()){
TreeNode* p=que.front();
que.pop();
path.push_back(p->val);
currentCount--;
if(p->left){
que.push(p->left);
nextCount++;
}
if(p->right){
que.push(p->right);
nextCount++;
}
if(