https://leetcode.com/problems/binary-tree-postorder-traversal/
1.递归
/**
* 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) {
post(root);
return result;
}
vector<int> result;
void post(TreeNode* root){
if(root==nullptr) return;
if(root->left!=nullptr)
post(root->left);
if(root->right!=nullptr)
post(root->right);
result.push_back(root->val);
}
};
2.非递归
将根节点压栈;
每次从栈中取栈顶节点,判断其是否有儿子节点,若没有子节点,则访问后弹栈,
若有子节点,则将右子节点、左子节点依次压栈,并切断与子节点之间的联系;
循环从栈中取元素执行上述操作。
/**
* 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*> s;
TreeNode* p = root;
if(p != nullptr)
s.push(p);
vector<int> result;
while(!s.empty()){
p = s.top();
if(p->left==nullptr && p->right==nullptr){
result.push_back(p->val);
s.pop();
}
else{
if(p->right!=nullptr){
s.push(p->right);
p->right=nullptr;
}
if(p->left!=nullptr){
s.push(p->left);
p->left=nullptr;
}
}
}
return result;
}
};