链接
https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/
耗时
解题:20 min
题解:2 min
题意
给定一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
例如:
给定二叉树
3
/ \
9 20
/ \
15 7
返回其自底向上的层次遍历为:
[
[15,7],
[9,20],
[3]
]
思路
正常 BFS 层序遍历,最后翻转一下答案。
时间复杂度: O ( n o d e ) O(node) O(node),树中节点的数量
AC代码
/**
* 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) {
if(root == NULL) return {};
vector<vector<int>> ans;
queue<TreeNode*> q;
q.push(root);
while(!q.empty()) {
int n = q.size();
vector<int> tmp;
tmp.clear();
for(int i = 0; i < n; ++i) {
TreeNode* now = q.front();
q.pop();
tmp.push_back(now->val);
if(now->left) q.push(now->left);
if(now->right) q.push(now->right);
}
ans.push_back(tmp);
}
reverse(ans.begin(), ans.end());
return ans;
}
};