import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;
import java.util.List;
class TreeNode {
int val;
TreeNode left;
TreeNode right;
// 构造函数
TreeNode() {}
TreeNode(int val)
{ this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<Integer>();
if (root == null) {
return res;
}
Deque<TreeNode> stack = new LinkedList<TreeNode>();
TreeNode prev = null;
while (root != null || !stack.isEmpty()) {
while (root != null) {
stack.push(root);
root = root.left;
}
root = stack.pop();
if (root.right == null || root.right == prev) {
res.add(root.val);
// prev指的是已经被添加进数组中的节点,如果再被遍历到就不遍历它了
prev = root;
root = null;
} else {
stack.push(root);
root = root.right;
}
}
return res;
}
}
class test{
public static void main(String[] args) {
TreeNode node1 = new TreeNode(1);
TreeNode node2 = new TreeNode(2);
TreeNode node3 = new TreeNode(3);
TreeNode node4 = new TreeNode(4);
TreeNode node5 = new TreeNode(5);
TreeNode node6 = new TreeNode(6);
TreeNode node7 = new TreeNode(7);
node1.left = node2;node1.right = node3;
node2.left = node4;node2.right = node5;
node3.left = node6;node3.right = node7;
List<Integer> res = new ArrayList<>();
res = new Solution().postorderTraversal(node1);
for (int i = 0; i < res.size(); i++) {
System.out.println(res.get(i));
}
}
}
树-后序遍历的迭代写法
最新推荐文章于 2024-02-19 16:18:50 发布