递归:
c++
class Solution {
public:
void postorder(TreeNode* root, vector<int> &res){
if(root == nullptr){
return;
}
postorder(root->left, res);
postorder(root->right, res);
res.push_back(root->val);
}
vector<int> postorderTraversal(TreeNode* root) {
vector<int> res;
postorder(root,res);
return res;
}
};
python
class Solution:
def postorderTraversal(self, root: TreeNode) -> List[int]:
res=[]
def postorder(root):
if not root:
return res;
postorder(root.left)
postorder(root.right)
res.append(root.val)
postorder(root)
return res
栈:
c++
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
vector<int> res;
if(root == nullptr){
return res;
}
stack<TreeNode*> stk;
TreeNode* prev = nullptr;
while(!stk.empty() || root != nullptr){
while(root){
stk.push(root);
root = root->left;
}
root = stk.top();
stk.pop();
if(root->right && root->right != prev){
stk.push(root);
root = root->right;
}else{
res.push_back(root->val);
prev = root;
root = nullptr;
}
}
return res;
}
};
python
class Solution:
def postorderTraversal(self, root: TreeNode) -> List[int]:
res = []
if not root:
return res
stk = []
prev = None
while root or stk:
while root:
stk.append(root)
root = root.left
root = stk[-1]
if root.right and root.right != prev:
root = root.right
else:
res.append(root.val)
prev = root
root = None
stk.pop()
return res