Binary Tree Inorder Traversal LeetCode solution in Java

1
/**
2
 * Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode
3
 * right; TreeNode() {} TreeNode(int val) { this.val = val; } TreeNode(int val, TreeNode left,
4
 * TreeNode right) { this.val = val; this.left = left; this.right = right; } }
5
 */
6
class Solution {
7
  List<Integer> li = new LinkedList<Integer>();
8

9
  public List<Integer> inorderTraversal(TreeNode root) {
10
    if (root == null) {
11
      List<Integer> li = new LinkedList<Integer>();
12
      return li;
13
    }
14
    inorderTraversal(root.left);
15
    li.add(root.val);
16
    inorderTraversal(root.right);
17
    return li;
18
  }
19
}