- 题目描述
给定一个二叉树,返回它的 后序 遍历。
输入: [1,null,2,3]
1
\
2
/
3
输出: [3,2,1]
-
思路
方法一:递归
方法二:非递归,按照根-右子树-左子树的顺序入栈,出栈后左右根即为后序遍历
方法三:前序遍历是根-左-右,用栈变成根-右-左,再reverse输出 -
c++实现
方法一:
class Solution {
public:
void postorder(vector<int> &vec,TreeNode *root)
{
if(root!=NULL)
{
postorder(vec,root->left);
postorder(vec,root->right);
vec.push_back(root->val);
}
}
vector<int> postorderTraversal(TreeNode *root) {
vector<int> vec;
postorder(vec,root);
return vec;
}
};
方法二:
class Solution {
public:
vector<int> postorderTraversal(TreeNode *root) {
stack<TreeNode*> s;
vector<int> res;
if(root==NULL) return res;
s.push(root);
TreeNode *cur=root;
TreeNode *pre=NULL;
while(!s.empty())
{
cur=s.top();
if(((cur->left==NULL)&&(cur->right==NULL))||((pre!=NULL)&&(cur->left==pre || cur->right==pre)))
{
res.push_back(cur->val);
s.pop();
pre=cur;
}
else
{
if(cur->right!=NULL)
s.push(cur->right);
if(cur->left!=NULL)
s.push(cur->left);
}
}
return res;
}
};
方法三:
class Solution {
public:
vector<int> postorderTraversal(TreeNode *root) {
stack<TreeNode*> s;
vector<int> res;
if(root==NULL) return res;
s.push(root);
TreeNode *cur=root;
while(!s.empty())
{
cur=s.top();
res.push_back(cur->val);
s.pop();
if(cur->left!=NULL)
s.push(cur->left);
if(cur->right!=NULL)
s.push(cur->right);
}
reverse(res.begin(),res.end());
return res;
}
};