Problem 3.8 TADM

shekhargulati · shekhargulati · commit ba13f48c753c · 2016-02-26T19:25:19.000+05:30
diff --git a/java8/src/main/java/com/shekhargulati/ninetynine_problems/java8/_00_random/tadm/ch03/Problem3_8.java b/java8/src/main/java/com/shekhargulati/ninetynine_problems/java8/_00_random/tadm/ch03/Problem3_8.java
@@ -2,6 +2,14 @@
 
 import java.util.Optional;
 
+/**
+ * Write a data structure that supports following operations.
+ * <p>
+ * insert(x,T) – Insert item x into the set T
+ * delete(k,T) – Delete the kth smallest element from T.
+ * member(x,T) – Return true iff x ∈ T .
+ * All operations must take O(log n) time on an n-element set.
+ */
 public class Problem3_8 {
 
     public static void main(String[] args) {
