给定一个二叉树,返回它的 后序 遍历。
示例:
输入: [1,null,2,3] 1 \ 2 / 3 输出: [3,2,1]
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
if(root!=null){
TreeNode left = root.left;
if(left!=null){
list.addAll(postorderTraversal(left)) ;
}
TreeNode right = root.right;
if(right!=null){
list.addAll(postorderTraversal(right)) ;
}
list.add(root.val);
}
return list;
}
}