递归:
/**
* 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> v;//作为全局变量
vector<int> postorderTraversal(TreeNode* root) {
if(root == NULL)
return v;
postorderTraversal(root->left);
postorderTraversal(root->right);
v.push_back(root->val);
return v;
}
};
stack方法的实现:
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
vector<int> v;
if(root == NULL)
return v;
stack<TreeNode*> s;
s.push(root);
while(s.size() > 0)
{
TreeNode* t = s.top();
if(t->left == NULL && t->right == NULL)
{
v.push_back(t->val);
s.pop();
}
else
{
if(t->right)
{
s.push(t->right);
t->right = NULL;//相当于标记作用
}
if(t->left)
{
s.push(t->left);
t->left = NULL;
}
}
}
return v;
}
};