# leetcode-145-Binary Tree Postorder Traversal

Binary Tree Postorder Traversal

Given a binary tree, return the postorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

1
\
2
/
3

return [3,2,1].

Note: Recursive solution is trivial, could you do it iteratively?

/**
* 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:
void houxu(TreeNode* root,vector<int>& s )
{
if(!root) return;
houxu(root->left,s);
houxu(root->right,s);
s.push_back(root->val);
}
vector<int> postorderTraversal(TreeNode* root) {
vector<int>s;
houxu(root,s);
return s;
}
};

/**
* 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:
/*
void houxu(TreeNode* root,vector<int>& s ) // 递归
{
if(!root) return;
houxu(root->left,s);
houxu(root->right,s);
s.push_back(root->val);
}
vector<int> postorderTraversal(TreeNode* root) {
vector<int>s;
houxu(root,s);
return s;
}
*/
vector<int> postorderTraversal(TreeNode* root) // 非递归
{
TreeNode* cur;
vector<int>v;
if(root==NULL) return v;

stack<TreeNode*>s;
s.push(root);

while(!s.empty()){
cur=s.top();
if(!cur->left&&!cur->right){
v.push_back(cur->val);
s.pop();
}
else{
if(cur->right){
s.push(cur->right);
cur->right=NULL;
}
if(cur->left){
s.push(cur->left);
cur->left=NULL;
}
}
}
return v;
}
};

• 本文已收录于以下专栏：

举报原因： 您举报文章：leetcode-145-Binary Tree Postorder Traversal 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)