没啥好说,二叉树的后序遍历,直接上代码
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
import java.util.*;
public class Solution {
public ArrayList<Integer> postorderTraversal(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
post(list, root);
return list;
}
public void post(ArrayList<Integer> list, TreeNode root){
if(root != null){
post(list, root.left);
post(list, root.right);
list.add(root.val);
}
}
}