文章来源地址https://www.toymoban.com/news/detail-851165.html
1.递归
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
accessTree(root,res);
return res;
}
public void accessTree(TreeNode root, List<Integer> res){
if(root == null){
return;
}
accessTree(root.left,res);
accessTree(root.right,res);
res.add(root.val);
}
2.循环迭代
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
Deque<TreeNode> stack = new LinkedList<>();
TreeNode prevAccess = null;
while( root!=null || !stack.isEmpty() ){
while (root !=null){
stack.push(root);
root = root.left;
}
root = stack.pop();
if(root.right == null || root.right == prevAccess){
res.add(root.val);
prevAccess = root;
root = null;
}else{
stack.push(root);
root = root.right;
}
}
return res;
}文章来源：https://www.toymoban.com/news/detail-851165.html
到了这里，关于LeetCode_145(二叉树的后序遍历)的文章就介绍完了。如果您还想了解更多内容，请在右上角搜索TOY模板网以前的文章或继续浏览下面的相关文章，希望大家以后多多支持TOY模板网！
