Stack and Queue using Linked List

Author: gopinav

linked-list-queue.js

@@ -0,0 +1,42 @@
+const LinkedList = require("./linked-list-tail");
+
+class LinkedListQueue {
+  constructor() {
+    this.list = new LinkedList();
+  }
+
+  enqueue(value) {
+    this.list.append(value);
+  }
+
+  dequeue() {
+    return this.list.removeFromFront();
+  }
+
+  peek() {
+    return this.list.head.value;
+  }
+
+  isEmpty() {
+    return this.list.isEmpty();
+  }
+
+  getSize() {
+    return this.list.getSize();
+  }
+
+  print() {
+    return this.list.print();
+  }
+}
+
+const queue = new LinkedListQueue();
+console.log(queue.isEmpty());
+queue.enqueue(10);
+queue.enqueue(20);
+queue.enqueue(30);
+console.log(queue.getSize());
+queue.print();
+console.log(queue.dequeue());
+queue.print();
+console.log(queue.peek());

linked-list-stack.js

@@ -0,0 +1,42 @@
+const LinkedList = require("./linked-list-tail");
+
+class LinkedListStack {
+  constructor() {
+    this.list = new LinkedList();
+  }
+
+  push(value) {
+    this.list.prepend(value);
+  }
+
+  pop() {
+    return this.list.removeFromFront();
+  }
+
+  peek() {
+    return this.list.head.value;
+  }
+
+  isEmpty() {
+    return this.list.isEmpty();
+  }
+
+  getSize() {
+    return this.list.getSize();
+  }
+
+  print() {
+    return this.list.print();
+  }
+}
+
+const stack = new LinkedListStack();
+console.log(stack.isEmpty());
+stack.push(20);
+stack.push(10);
+stack.push(30);
+console.log(stack.getSize());
+stack.print();
+console.log(stack.pop());
+stack.print();
+console.log(stack.peek());

linked-list-tail.js

@@ -5,7 +5,7 @@ class Node {
   }
 }
 
-export class LinkedList {
+class LinkedList {
   constructor() {
     this.head = null;
     this.tail = null;
@@ -103,6 +103,10 @@ export class LinkedList {
   }
 }
 
+module.exports = LinkedList;
+
+/** Uncomment when testing only this file */
+/**
 const list = new LinkedList();
 list.append(1);
 list.append(2);
@@ -114,3 +118,4 @@ list.removeFromFront();
 list.print();
 list.removeFromEnd();
 list.print();
+*/