better docs

Author: amejiarosario

src/data-structures/sets/hash-set.js

@@ -1,6 +1,8 @@
 const HashMap = require('../maps/hash-maps/hashmap');
+
 /**
- * Set implemented with our HashMap to have sublinear times on all operations
+ * Set implemented with our HashMap
+ * Have an average of O(1) time on all operations
  */
 class HashMapSet {
   /**

src/data-structures/sets/tree-set.js

@@ -1,5 +1,5 @@
-// const Tree = require('../trees/avl-tree');
-const Tree = require('../trees/red-black-tree');
+// const Tree = require('../trees/avl-tree'); // faster lookups
+const Tree = require('../trees/red-black-tree'); // faster insertion
 
 /**
  * TreeSet implements a Set (collection of unique values)
@@ -24,6 +24,7 @@ class TreeSet {
 
   /**
    * Add a new value (duplicates will be added only once)
+   * Runtime: O(log n)
    * @param {any} value
    */
   add(value) {
@@ -33,37 +34,40 @@ class TreeSet {
   }
 
   /**
-   * check if value is already on the set
+   * Check if value is already on the set
+   * Runtime: O(log n)
    * @param {any} value
+   * @returns {boolean} true if exists or false otherwise
    */
   has(value) {
     return !!this.tree.get(value);
   }
 
   /**
    * Delete a value from the set
+   * Runtime: O(log n)
    * @param {any} value
    */
   delete(value) {
     return this.tree.remove(value);
   }
 
   /**
-   * Get all the values on the Set
+   * Default iterator for this set
    * @returns {iterator} values in ascending order
    */
-  * keys() {
+  * [Symbol.iterator]() {
     for (const node of this.tree.inOrderTraversal()) {
       yield node.value;
     }
   }
 
   /**
-   * Default iterator for this set
+   * Get all the values on the Set
    * @returns {iterator} values in ascending order
    */
-  * [Symbol.iterator]() {
-    yield* this.keys();
+  * keys() {
+    yield* this;
   }
 
   /**