Last active
February 13, 2020 23:58
-
-
Save Giagnus64/636e12f0590dec1ef881c5cc2e9631f2 to your computer and use it in GitHub Desktop.
linked list implementation of queue
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Node { | |
| constructor(value) { | |
| this.value = value; | |
| this.next = null; | |
| } | |
| } | |
| class Queue { | |
| constructor(){ | |
| this.first = null; | |
| this.last = null; | |
| this.size = 0; | |
| } | |
| //newnode goes to back of the line/end of the queue | |
| enqueue(value){ | |
| const newNode = new Node(value); | |
| //if queue is empty | |
| if (this.size === 0) { | |
| this.first = newNode; | |
| this.last = newNode; | |
| // add current first pointer to new first(new node), and make new node new first | |
| } else { | |
| this.last.next = newNode; | |
| this.last = newNode; | |
| } | |
| //add 1 to size | |
| this.size++; | |
| return this; | |
| } | |
| // dequeue nodes off the front of the line | |
| dequeue(){ | |
| //if queue is empty return false | |
| if (this.size === 0) return false; | |
| //get dequeuednode | |
| const dequeuedNode = this.first; | |
| //get new first (could be NULL if stack is length 1) | |
| const newFirst = this.first.next; | |
| //if newFirst is null, reassign last to newFirst(null) | |
| if (!newFirst) { | |
| this.last = newFirst; | |
| } | |
| //assign new first | |
| this.first = newFirst; | |
| //remove reference to list | |
| dequeuedNode.next = null; | |
| //remove 1 from size | |
| this.size--; | |
| //return dequeuednode | |
| return dequeuedNode; | |
| } | |
| log(){ | |
| let currentNode = this.first | |
| let i = 0; | |
| while(currentNode){ | |
| console.log(i, currentNode.value) | |
| i++; | |
| currentNode = currentNode.next | |
| } | |
| } | |
| } | |
| const printQueue = new Queue(); | |
| printQueue.enqueue("Data_Report.csv"); | |
| printQueue.log() | |
| //["Resume.docx", "Data_Report.csv"] | |
| printQueue.enqueue("Picture_of_Biscuit.png"); | |
| printQueue.log() | |
| //["Resume.docx", "Data_Report.csv", "Picture_of_Biscuit.png"] | |
| printQueue.dequeue(); | |
| //"Resume.docx" | |
| printQueue.log() | |
| //["Data_Report.csv","Picture_of_Biscuit.png"] | |
| printQueue.dequeue(); | |
| //"Data_report.csv" | |
| printQueue.log() |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment