107. 二叉树的层次遍历 II
时间:2020年9月6日
知识点:bfs
题目链接: https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/
题目
给定一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
示例
输入:
给定二叉树 [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
输出:
返回其自底向上的层次遍历为:
[
[15,7],
[9,20],
[3]
]
代码
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
vector<vector<int>> levelOrderBottom(TreeNode* root) {
queue<TreeNode*> q;
vector<vector<int>> ans;
if(root == nullptr)
return ans;
q.push(root);
while(!q.empty()){
vector<int> tmp;
int num = q.size();
for(int i=0;i<num;i++){
TreeNode* node = q.front();
q.pop();
tmp.push_back(node->val);
if(node->left)
q.push(node->left);
if(node->right)
q.push(node->right);
}
ans.push_back(tmp);
}
reverse(ans.begin(), ans.end());
return ans;
}
};
int main()
{
TreeNode root(3);
TreeNode r1(9);TreeNode r2(20);
TreeNode r3(15);TreeNode r4(7);
root.left = &r1;root.right = &r2;r2.left = &r3;r2.right = &r4;
Solution s;
vector<vector<int>> ans = s.levelOrderBottom(&root);
for(int i=0;i<ans.size();i++){
for(int j=0;j<ans[i].size();j++){
cout<<ans[i][j]<<" ";
}
cout<<endl;
}
return 0;
}