题目:
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
For example:
Given binary tree [3,9,20,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
return its bottom-up level order traversal as:
[ [15,7], [9,20], [3] ]题目链接
题意:
给一个二叉树,要求按照从底层到顶层的顺序遍历整个二叉树,每一层的节点从左到右输出。
在递归的同时维护一个变量depth,表示当前的深度,每次向表示当前深度的vector添加节点,最后把ans反转一下顺序,就变成了从底层项顶层的顺序。
代码如下:
class Solution {
public:
vector<vector<int>> ans;
void dfs(TreeNode* node, int depth) {
if (!node) return;
if (ans.size() <= depth) {
ans.push_back({node->val});
}
else {
ans[depth].push_back(node->val);
}
dfs(node->left, depth+1);
dfs(node->right, depth+1);
}
vector<vector<int>> levelOrderBottom(TreeNode* root) {
dfs(root, 0);
reverse(ans.begin(), ans.end());
return ans;
}
};