题目链接:LeetCode 107. 二叉树的层次遍历 II
题意:
给定一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
例如:
给定二叉树 [3,9,20,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
返回其自底向上的层次遍历为:
[ [15,7], [9,20], [3] ]
解题思路:
采用bfs宽度优先搜索
/**
* 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>> levelOrderBottom(TreeNode* root) {
queue<TreeNode*> q;
if(root != NULL) {
q.push(root);
}
vector<vector<int>> ans;
while(!q.empty()) {
vector<int> t;
int size = q.size();
for(int i = 0; i < size; i++) {
TreeNode* node = q.front();
t.push_back(node->val);
q.pop();
if(node->left != NULL) {
q.push(node->left);
}
if(node->right != NULL) {
q.push(node->right);
}
}
ans.push_back(t);
}
reverse(ans.begin(), ans.end());
return ans;
}
};