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 binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> postorderTraversal(TreeNode *root) {
if(!root) //note this
return vector<int>();
vector<int> res;
stack<TreeNode*> st;
set<TreeNode*> visited;
st.push(root);
while(!st.empty()){
TreeNode* node = st.top();
st.pop();
if(visited.find(node) != visited.end()){
res.push_back(node->val);
}else{
st.push(node);
if(node->right){
st.push(node->right);
}
if(node->left){
st.push(node->left);
}
visited.insert(node);
}
}
return res;
}
};