给定一个二叉树,返回它的 后序 遍历。
示例:
输入: [1,null,2,3]
1
2
/
3
输出: [3,2,1]
进阶: 递归算法很简单,你可以通过迭代算法完成吗?
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/binary-tree-postorder-traversal
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
/**
* 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:
void postorder(TreeNode *T,vector<int> &tmp){
if(T != NULL){
if(T->left != NULL){
postorder(T->left,tmp);
}
if(T->right != NULL){
postorder(T->right,tmp);
}
tmp.push_back(T->val);
}
}
vector<int> postorderTraversal(TreeNode* root) {
vector<int> ans;
postorder(root,ans);
return ans;
}
迭代,先检测左子树再检测右子树的先序遍历,将序列逆序后得到后序遍历
vector<int> postorderTraversal(TreeNode* root) {
vector<int> ans;
if(root != NULL){
stack<TreeNode *> t1,t2;
while(t1.empty() == false)t1.pop();
while(t2.empty() == false)t2.pop();
t1.push(root);
while(t1.empty() == false){
TreeNode *tmp = t1.top();
t2.push(t1.top());
t1.pop();
if(tmp->left != NULL){
t1.push(tmp->left);
}
if(tmp->right != NULL){
t1.push(tmp->right);
}
}
while(t2.empty() == false){
int tmp2 = t2.top()->val;
ans.push_back(tmp2);
t2.pop();
}
return ans;
}
return ans;
}
};