Created
December 5, 2016 23:11
-
-
Save minsooshin/b57802fce2ae161a6b609c4400c030b6 to your computer and use it in GitHub Desktop.
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(element) { | |
this.element = element; | |
this.next = null; | |
} | |
} | |
class LinkedList { | |
constructor() { | |
this.head = new Node('head'); | |
} | |
find(item) { | |
let currentNode = this.head; | |
while (currentNode.element !== item) { | |
currentNode = currentNode.next; | |
} | |
return currentNode; | |
} | |
findPrevious(item) { | |
let currentNode = this.head; | |
while (currentNode.next !== null && currentNode.next.element !== item) { | |
currentNode = currentNode.next; | |
} | |
return currentNode; | |
} | |
display() { | |
let currentNode = this.head; | |
while (currentNode.next !== null) { | |
console.log(currentNode.element); | |
currentNode = currentNode.next; | |
} | |
} | |
insert(element, item) { | |
let newNode = new Node(element); | |
let currentNode = this.find(item); | |
newNode.next = currentNode.next; | |
currentNode.next = newNode; | |
} | |
remove(item) { | |
let previousNode = this.findPrevious(item); | |
if (previousNode.next !== null) { | |
previousNode.next = previousNode.next.next; | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment