解题思路：

递归

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