Create 0096-unique-binary-search-trees.java

Author: sujal-goswami

Diff for: java/0096-unique-binary-search-trees.java

@@ -0,0 +1,17 @@
+class Solution {
+    public int numTrees(int n) {
+        int[] numTree = new int[n+1];
+        numTree[0] = numTree[1] = 1;
+
+        for(int nodes = 2; nodes < n+1; nodes++){
+            int total = 0;
+            for(int root = 1; root < nodes+1; root++){
+                int left = root - 1;
+                int right = nodes - root;
+                total += numTree[left] * numTree[right];
+            }
+            numTree[nodes] = total;
+        }
+        return numTree[n];
+    }
+}