better docs

Author: amejiarosario

src/data-structures/maps/tree-maps/tree-map.js

@@ -9,12 +9,12 @@ const Tree = require('../../trees/red-black-tree'); // fast insertion
  *
  * Implementing a Map with a tree, TreeMap,
  * has a couple of advantages over a HashMap:
- *    •	Keys are always sorted.
- *    •	Statistical data can be easily obtained like median,
+ *    • Keys are always sorted.
+ *    • Statistical data can be easily obtained like median,
  *        highest, lowest key.
- *    •	Collisions are not a concern so in the worst case is
+ *    • Collisions are not a concern so in the worst case is
  *        still O(log n).
- *    •	Trees are more space efficient and doesn’t need to
+ *    • Trees are more space efficient and doesn’t need to
  *        allocate memory beforehand (e.g. HashMap’s initial capacity)
  *        nor you have to rehash when is getting full.
  *

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

@@ -17,14 +17,16 @@ class HashMapSet {
 
   /**
    * Add a new value (duplicates will be added only once)
+   * Avg. Runtime: O(1)
    * @param {any} value
    */
   add(value) {
     this.hashMap.set(value);
   }
 
   /**
-   * check if value is already on the set
+   * Check if value is already on the set
+   * Avg. Runtime: O(1)
    * @param {any} value
    */
   has(value) {
@@ -40,6 +42,7 @@ class HashMapSet {
 
   /**
    * Delete a value from the set
+   * Avg. Runtime: O(1)
    * @param {any} value
    */
   delete(value) {

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

@@ -40,7 +40,7 @@ class TreeSet {
    * @returns {boolean} true if exists or false otherwise
    */
   has(value) {
-    return !!this.tree.get(value);
+    return this.tree.has(value);
   }
 
   /**