diff --git a/java/_095UniqueBinarySearchTreesII.java b/java/_095UniqueBinarySearchTreesII.java
index 7da5566..fefbc12 100644
--- a/java/_095UniqueBinarySearchTreesII.java
+++ b/java/_095UniqueBinarySearchTreesII.java
@@ -2,6 +2,17 @@
 import java.util.List;
 
 /**
+ * Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n.
+ * <p>
+ * For example,
+ * Given n = 3, your program should return all 5 unique BST's shown below.
+ * <p>
+ * 1         3     3      2      1
+ *  \       /     /      / \      \
+ *   3     2     1      1   3      2
+ *  /     /       \                 \
+ * 2     1         2                 3
+ * <p>
  * Created by drfish on 27/05/2017.
  */
 public class _095UniqueBinarySearchTreesII {