@@ -0,0 +1,465 @@
+package leetcode.unique_binary_search_trees;%0A%0Apublic class Solution %7B%0A    public int numTrees(int n) %7B%0A        return Catalan(n);%0A    %7D%0A    public static int Catalan(int n)%7B%0A    %09long ans = 1;%0A    %09for(int i = 1; i %3C= n; i++)%7B%0A    %09%09ans *= (2 * n - i + 1);%0A    %09%09ans /= i;%0A    %09%7D%0A    %09return (int)(ans / (n + 1));%0A    %7D%0A    %0A    public static void main(String%5B%5D args)%7B%0A    %09for(int i = 0; i %3C 10; i++)%7B%0A    %09%09System.err.println(Solution.Catalan(i));%0A    %09%7D%0A    %7D%0A%7D%0A

Add java solution for 96. Unique Binary Search Trees