class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List <Integer> list=new ArrayList< >();
helper(root,list);
return list;
if(root!= null){
if(root.left!= null){
helper(root.left,list);
}
list.add(root.val);
if (root.right != null) {
helper(root.right,list);
}
}
}
}
public List<Integer> inorderTraversal(TreeNode root) {
List <Integer> list=new ArrayList< >();
helper(root,list);
return list;
}
//从头结点开始遍历,先遍历左子树,再遍历右子树
public void helper(TreeNode root,List<Integer> list){if(root!= null){
if(root.left!= null){
helper(root.left,list);
}
list.add(root.val);
if (root.right != null) {
helper(root.right,list);
}
}
}
}