diff --git a/Chapter 5 - Linked Lists/copy.js b/Chapter 5 - Linked Lists/copy.js
index c19d49b..e4bf002 100644
--- a/Chapter 5 - Linked Lists/copy.js	
+++ b/Chapter 5 - Linked Lists/copy.js	
@@ -24,7 +24,6 @@ function copy(LL){
     }
     while(runner){
         var  nextNode = new listNode(runner.val);
-        console.log(nextNode.val);
         previousNode.next = nextNode;
         previousNode = nextNode;
         runner = runner.next;
diff --git a/Chapter6 - Queues and Stacks/Deque: Implementation.js b/Chapter6 - Queues and Stacks/Deque: Implementation.js
new file mode 100644
index 0000000..9fdce1b
--- /dev/null
+++ b/Chapter6 - Queues and Stacks/Deque: Implementation.js	
@@ -0,0 +1,64 @@
+// Having combined the designs of Stack and Queue, why not combine features as well. Let's create a class Deque (pronounced 'deck') representing a double-ended queue. On top of the basic six methods, ernable it to push and pop from opposite ends. Specifically, build class Deque with pushFront(val), pushBack(val), popFront(), front(), back(), contains(val), isEmpty(), and size().
+
+class listNode{
+    constructor(val){
+    this.val = val;
+    this.next = null;
+    }
+}
+
+
+class Deque{
+    constructor(){
+    this.head = null;
+    }
+    pushFront(val){
+        var newNode = new listNode(val);
+        if(!this.head){
+            this.head = newNode;
+        }
+        else{
+            var runner = this.head;
+            this.head = newNode;
+            newNode.next = runner;
+        }
+        return this;
+    }
+    pushBack(val){
+        var newNode = new listNode(val);
+        if(!this.head){
+            this.head = newNode;
+        }
+        else{
+            var runner = this.head;
+            while(runner.next){
+                runner = runner.next;
+            }
+            runner.next = newNode;
+        }
+        return this;
+        
+    }
+    popFront(){
+        if(!this.head){
+            return "List is empty";
+        }
+        else{
+            var temp = this.head.next;
+            this.head = null;
+            this.head = temp;
+        }
+        return this;
+    }
+}
+
+var deque = new Deque();
+console.log(deque.pushFront(1));
+console.log(deque.pushFront(2));
+console.log(deque.pushFront(3));
+console.log(deque.pop)
+
+// var deque1 = new Deque();
+// console.log(deque1.pushBack(1))
+// console.log(deque1.pushBack(3))
+// console.log(deque1.pushBack(2))
\ No newline at end of file