algorithm/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2025-07-08 02:14:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

Minor code style fixes for DoublyLinkedList.

Browse Source
This commit is contained in:
Oleksii Trekhleb
2018-07-05 15:33:39 +03:00
parent 6a5ed26bd2
commit a72fda4dfd
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
src/data-structures/doubly-linked-list/DoublyLinkedList.js
View File

@ -23,9 +23,9 @@ export default class DoublyLinkedList {
// Make new node to be a head.
const newNode = new DoublyLinkedListNode(value, this.head);
// If there is head, then it won't be head anymore
// Therefore, make its previous reference to be new node (new head)
// Then mark the new node as head
// If there is head, then it won't be head anymore.
// Therefore, make its previous reference to be new node (new head).
// Then mark the new node as head.
if (this.head) {
this.head.previous = newNode;
}
@ -57,7 +57,7 @@ export default class DoublyLinkedList {
// Attach new node to the end of linked list.
this.tail.next = newNode;
// Attach current tail to the new node's previous reference
// Attach current tail to the new node's previous reference.
newNode.previous = this.tail;
// Set new node to be the tail of linked list.
@ -83,10 +83,10 @@ export default class DoublyLinkedList {
deletedNode = currentNode;
if (deletedNode === this.head) {
// set head to second node, which will become new head
// Set head to second node, which will become new head.
this.head = deletedNode.next;
// set new head's previous to null
// Set new head's previous to null
if (this.head) {
this.head.previous = null;
}