leetcode145
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?
二叉树后序遍历,用递归的确很简单,就不讨论了。这是我做的第一道hard题,,竟然一次过,顿时感觉666,可是事后一想其实也没那么难,通过率还是很高的,试用stack从根节点开始,先入栈,然后弹栈,将值域放入vector中,然后先将左节点入栈,再将右节点入栈,开始循环,最终得到将后序遍历的结果反序放入vector中的结果,然后只要反排一下数组就搞定啦,,,是不是很简单呢,,今天一次就过有点得瑟,上个图秀下。好了,上代码
/**
* 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:
vector<int> postorderTraversal(TreeNode* root) {
stack<TreeNode*> st;
vector<int> vi;
TreeNode * temp;
if (root == NULL)
return vector<int>();
st.push(root);
while (!st.empty())
{
temp = st.top();
st.pop();
vi.push_back(temp->val);
if(temp->left)
st.push(temp->left);
if(temp->right)
st.push(temp->right);
}
return vector<int>(vi.rbegin(), vi.rend());
}
};