力扣(LeetCode)官网 - 全球极客挚爱的技术成长平台
class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList();
postOrder(list,root);
return list;
}
public static void postOrder(List<Integer> list,TreeNode node){
if(node == null){
return;
}
if(node.left != null){
postOrder(list,node.left);
}
if(node.right != null){
postOrder(list,node.right);
}
list.add(node.val);
}
}