java - 94. 二叉树的中序遍历 - 递归实现

class TreeNode {
     int val;
     TreeNode left;
     TreeNode right;
     TreeNode() {}
     TreeNode(int val) { this.val = val; }
     TreeNode(int val, TreeNode left, TreeNode right) {
         this.val = val;
         this.left = left;
         this.right = right;
     }
 }

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