题目链接
法一(递归)
private List<Integer> postorder = new ArrayList<>();
private void dfs(TreeNode root){
if(root == null){
return;
}
dfs(root.left);
dfs(root.right);
postorder.add(root.val);
}
public List<Integer> postorderTraversal(TreeNode root) {
dfs(root);
return postorder;
}
本地测试
lay.showTitle(145);
Solution145 sol145 = new Solution145();
List<Integer> arr145 = Arrays.asList(1,null,2,3);
TreeNode root145 = treeOpt.createTreeByLayerOrder(arr145);
treeOpt.layerOrder(root145);
arrayOpt.showIntList(sol145.postorderTraversal(root145));