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 解题报告

2016-05-25 00:48:57

LeetCode(145)Binary Tree Postorder Traversal

2014-01-16 04:01:50

Construct Binary Tree from Inorder and Postorder Traversal -- LeetCode

2014-04-24 09:02:17

【LeetCode-面试算法经典-Java实现】【106-Construct Binary Tree from Inorder and Postorder Traversal（构造二叉树II）】

2015-08-09 06:39:31

106 Construct Binary Tree from Inorder and Postorder Traversal

2015-12-09 20:29:35

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

2017-04-28 11:29:02

LeetCode145 Binary Tree Postorder Traversal Java题解（递归 迭代）

2015-07-09 10:34:20

Given preorder and inorder traversal of a tree, construct the binary tree.

2014-12-04 23:07:11

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

2017-03-17 14:27:14

Tree Traversal（树的遍历）

2018-01-09 12:43:59