Method inorder

Java/binary-tree-inorder-traversal.java:22–36

(TreeNode root, List<Integer> list)

    }

    public void inorder(TreeNode root, List<Integer> list){
	/* Inorder traversal is visiting : left subtree then root then right subtree */

	/* if node is null, then return back to the caller function */
        if(root==null)
            return;
	/* Recurse for left subtree */
        inorder(root.left, list);

	/* Add the current node's value to the list */
        list.add(root.val);

	/* Recurse for right subtree */
        inorder(root.right, list);
    }
}