Description
https://leetcode.com/problems/binary-tree-postorder-traversal
Solving Ideas
后序遍历
Solution
递归
import java.util.*;
class Solution {
private void travelCore(TreeNode root, List<Integer> res){
if(root == null) return;
travelCore(root.left, res);
travelCore(root.right, res);
res.add(root.val);
}
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
travelCore(root, res);
return res;
}
}
非递归
import java.util.*;
class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
LinkedList<Integer> res = new LinkedList<>();
if(root == null) return res;
LinkedList<TreeNode> stack = new LinkedList<>();
stack.push(root);
while(!stack.isEmpty()){
TreeNode node = stack.pop();
res.push(node.val);
if(node.left != null) stack.push(node.left);
if(node.right != null) stack.push(node.right);
}
return res;
}
}