src/data-structures/doubly-linked-list/README.md

@@ -64,7 +64,7 @@ Remove(head, value)
     return true
   end if
   n ← head.next
-  while n = ø and value = n.value
+  while n = ø and value !== n.value
     n ← n.next
   end while
   if n = tail
@@ -100,7 +100,7 @@ end Reverse Traversal
 
 | Access    | Search    | Insertion | Deletion  |
 | :-------: | :-------: | :-------: | :-------: |
-| O(n)      | O(n)      | O(1)      | O(1)      |
+| O(n)      | O(n)      | O(1)      | O(n)      |
 
 ### Space Complexity
 

src/data-structures/hash-table/HashTable.js

@@ -59,7 +59,7 @@ export default class HashTable {
       bucketLinkedList.append({ key, value });
     } else {
       // Update value of existing node.
-      node.value.value = value;
+      node.value = value;
     }
   }
 
@@ -88,7 +88,7 @@ export default class HashTable {
     const bucketLinkedList = this.buckets[this.hash(key)];
     const node = bucketLinkedList.find({ callback: nodeValue => nodeValue.key === key });
 
-    return node ? node.value.value : undefined;
+    return node ? node.value : undefined;
   }
 
   /**