feat(linkedList): remove by node

Author: amejiarosario

src/data-structures/linked-lists/linked-list.js

@@ -265,6 +265,25 @@ class LinkedList {
     return false;
   }
 
+  /**
+   * Remove element by Node
+   * O(1)
+   */
+  removeByNode(node) {
+    if (!node) { return null; }
+    if (node === this.first) {
+      return this.removeFirst();
+    }
+    if (node === this.last) {
+      return this.removeLast();
+    }
+    node.previous.next = node.next;
+    node.next.previous = node.previous;
+    this.size -= 1;
+
+    return node.value;
+  }
+
   /**
    * Iterate through the list yield on each node
    * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Iterators_and_Generators#User-defined_iterables

src/data-structures/linked-lists/linked-list.spec.js

@@ -223,6 +223,33 @@ describe('LinkedList Test', () => {
         expect(linkedList.length).toBe(1);
       });
     });
+
+    describe('#removeByNode', () => {
+      it('should remove first node', () => {
+        const node = linkedList.first;
+        linkedList.removeByNode(node);
+        expect(linkedList.first.value).toEqual('found');
+        expect(linkedList.first.previous).toEqual(null);
+        expect(linkedList.size).toEqual(1);
+      });
+
+      it('should remove last node', () => {
+        const node = linkedList.last;
+        linkedList.removeByNode(node);
+        expect(linkedList.first.value).toEqual(0);
+        expect(linkedList.first.next).toEqual(null);
+        expect(linkedList.size).toEqual(1);
+      });
+
+      it('should remove from the middle', () => {
+        const node = linkedList.first;
+        linkedList.addLast('last');
+        linkedList.removeByNode(node);
+        expect(linkedList.first.next).toEqual(linkedList.last);
+        expect(linkedList.last.previous).toEqual(linkedList.first);
+        expect(linkedList.size).toEqual(2);
+      });
+    });
   });
 
   describe('Doubly Linked List and aliases', () => {