https://leetcode.com/problems/binary-tree-level-order-traversal-ii/
在leetcode102题的基础上,将vector反序即可。
1.递归
/**
* 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) {
dfs(root, 1);
std::reverse(result.begin(), result.end());//在leetcode102题基础上,增加这样一行即可
return result;
}
vector<vector<int>> result;
void dfs(TreeNode* root, int depth){
if(root==nullptr) return;
if(result.size()<depth){
vector<int> x;
x.push_back(root->val);
result.push_back(x);
}
else
result[depth-1].push_back(root->val);
if(root->left!=nullptr)
dfs(root->left, depth+1);
if(root->right!=nullptr)
dfs(root->right, depth+1);
}
};
2.非递归
/**
* 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>> levelOrder(TreeNode* root) {
vector<vector<int>> result;
queue<TreeNode*> a, b; //用两个队列交替存储对方的子节点
if(root!=nullptr){
a.push(root);
}
while(!a.empty() || !b.empty()){
vector<int> tmp;
while(!a.empty()){
TreeNode* p = a.front();
a.pop();
tmp.push_back(p->val);
if(p->left!=nullptr)
b.push(p->left);
if(p->right!=nullptr)
b.push(p->right);
}
if(!tmp.empty())
result.push_back(tmp);
vector<int> second;
while(!b.empty()){
TreeNode* p = b.front();
b.pop();
second.push_back(p->val);
if(p->left!=nullptr)
a.push(p->left);
if(p->right!=nullptr)
a.push(p->right);
}
if(!second.empty())
result.push_back(second);
}
std::reverse(result.begin(), result.end());//在leetcode102题基础上,增加这样一行即可
return result;
}
};