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