迭代解法
思路:
使用 Stack
入栈顺序: 中 -> 左 -> 右
出栈顺序: 中-> 右 ->左
最后反转结果
/**
* Definition for a binary tree node.
* public 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 LinkedList<>();
if (root == null) return res;
Stack<TreeNode> stk = new Stack<>();
stk.push(root);
while (!stk.isEmpty()) {
TreeNode t = stk.pop();
res.add(t.val);
if (t.left != null) {
stk.push(t.left);
}
if (t.right != null) {
stk.push(t.right);
}
}
Collections.reverse(res);
return res;
}
}
···