给你二叉树的根节点 root
,返回其节点值 自底向上的层序遍历 。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
输入: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
思路:开辟一个栈存储每层节点
/**
* 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>> res;
if(!root) return res;
int size;
TreeNode* p;
queue<TreeNode*> que;
vector<int> path;
stack<vector<int>> s;
que.push(root);
while(!que.empty()){
size=que.size();
path.clear();
while(size--){
p=que.front();
que.pop();
path.push_back(p->val);
if(p->left)
que.push(p->left);
if(p->right)
que.push(p->right);
}
s.push(path);
}
while(!s.empty()){
res.push_back(s.top());
s.pop();
}
return res;
}
};