public List<Integer> LinkedList = new ArrayList<>();
public List<Integer> postorderTraversal(TreeNode root) {
if (root == null) {
return new ArrayList<>();
}
List<Integer> left = postorderTraversal(root.left);
List<Integer> right = postorderTraversal(root.right);
List<Integer> list = new ArrayList<>();
list.addAll(left);
list.addAll(right);
list.add(root.val);
return list;
}