二叉树的遍历（后序）-非递归实现

最新推荐文章于 2022-07-30 16:08:18 发布

流星逐月

最新推荐文章于 2022-07-30 16:08:18 发布

阅读量472

点赞数

分类专栏：畅游算法文章标签：二叉树递归

本文链接：https://blog.csdn.net/u010106759/article/details/69808897

版权

畅游算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

List postorderTraversal(TreeNode root) {
List result = new ArrayList();
if (root == null)
return result;
Stack stack = new Stack();
TreeNode p = root;
TreeNode last = null;
while (p != null || !stack.isEmpty()) {
if (p != null) {
stack.push(p);
p = p.left;
} else {
TreeNode peek = stack.peek();
if (peek.right != null && last != peek.right) {
p = peek.right;
} else {
peek = stack.pop();
result.add(peek.val);
last = peek;
}
}
}
return result;
}