leetcode 中序遍历二叉树 java

给定一个二叉树，返回它的中序 遍历。

示例:

输入: [1,null,2,3]
   1
    \
     2
    /
   3

输出: [1,3,2]

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> resultList = new ArrayList<>();
        
        if(root==null){
            return resultList;
        }
        
        helper(resultList,root);
        
        return resultList;
    }
    
    public void helper(List<Integer> resultList,TreeNode root){
        
        if(root==null){
            return;
        }
       helper(resultList,root.left);
       
        
        resultList.add(root.val);
        
         helper(resultList,root.right);
        
    }
}