public List preorderTraversal(TreeNode root) {
List list = new ArrayList<>();
inoder(root,list);
return list;
}
public void inoder(TreeNode root,List<Integer> list){
if(root==null)return;
list.add(root.val);
inoder(root.left,list);
inoder(root.right,list);
}