给你二叉树的根节点 root ,返回其节点值 自底向上的层序遍历 。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
示例 1:
输入:root = [3,9,20,null,null,15,7]
输出:[[15,7],[9,20],[3]]
示例 2:
输入:root = [1]
输出:[[1]]
示例 3:
输入:root = []
输出:[]
提示:
- 树中节点数目在范围 [0, 2000] 内
- -1000 <= Node.val <= 1000
方法1:普通的层次遍历序列+reverse
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<vector<int>> levelOrderBottom(TreeNode* root) {
vector<vector<int>> vec;
if (root == nullptr) return vec;
queue<TreeNode*> que;
TreeNode* p;
que.push(root);
while (!que.empty()) {
int curSize = que.size();//当前层由多少个根节点
vec.push_back(vector<int>());
vec.reserve(curSize);
for (size_t i = 0; i < curSize; i++) {
p = que.front(); que.pop();
vec.back().push_back(p->val);//顺序值
if (p->left != nullptr) que.push(p->left);
if (p->right != nullptr) que.push(p->right);
}
}
reverse(vec.begin(), vec.end());
return vec;
}
};
方法2:在方法1框架上同样也可使用栈的方式实现
vector<vector<int>> levelOrderBottom(TreeNode* root) {
vector<vector<int>> vec;
if (root == nullptr) return vec;
stack<vector<int>> st1;//总栈
queue<TreeNode*> que;
TreeNode* p;
que.push(root);
while (!que.empty()){
int curSize = que.size();//当前层由多少个根节点
vector<int> v;
v.reserve(curSize);
for (size_t i = 0; i < curSize; i++){
p = que.front(); que.pop();
v.push_back(p->val);
if (p->left != nullptr) que.push(p->left);
if (p->right != nullptr) que.push(p->right);
}
st1.push(v);//将当前层中所有节点作为一个数组入栈
}
while (!st1.empty()){
vec.push_back(st1.top());
st1.pop();
}
return vec;
}
DFS深度优先遍历
class Solution {
public:
vector<vector<int>> levelOrderBottom(TreeNode* root) {
vector<vector<int>> res;
int depth = 0;
levelOrder(root, res, depth);
reverse(res.begin(), res.end());//对正常的层次遍历序列逆序
return res;
}
private:
void levelOrder(TreeNode* root, vector<vector<int>>& res, int depth) {
if (root == nullptr) return;
if (res.size() == depth) res.push_back(vector<int>());
res[depth].push_back(root->val);
levelOrder(root->left, res, depth + 1);
levelOrder(root->right, res, depth + 1);
}
};
DFS方法,先遍历每一层的第一个节点,直至最深层;然后再回退,以层次递减的方式(回溯)对每一层的的节点进行添加。