algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 16:26:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

merge: fixed some spellings (#773)

Browse Source 
* fixed some spellings

* Update Data-Structures/Linked-List/SinglyLinkList.js

Co-authored-by: Rak Laptudirm <raklaptudirm@gmail.com>

Co-authored-by: Rak Laptudirm <raklaptudirm@gmail.com>
This commit is contained in:
Devansh Gupta
2021-10-22 13:26:26 +05:30
committed by GitHub
parent ffbfb20b50
commit e83b570d44
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
Data-Structures/Linked-List/SinglyLinkList.js
View File

@ -1,7 +1,7 @@
/* SinglyLinkedList!! /* SinglyLinkedList!!
* A linked list is implar to an array, it hold values. * A linked list is similar to an array, it holds a list of values.
* However, links in a linked list do not have indexes. With * However, links in a linked list do not have indexes. With
* a linked list you do not need to predetermine it's size as * a linked list you do not need to predetermine its size as
* it grows and shrinks as it is edited. This is an example of * it grows and shrinks as it is edited. This is an example of
* a singly linked list. * a singly linked list.
*/ */
@ -17,7 +17,7 @@ const LinkedList = (function () {
this.head = null this.head = null
} }
// class node (constructor) // Class node (constructor)
// Creating Node with element's value // Creating Node with element's value
const Node = (function () { const Node = (function () {
function Node (element) { function Node (element) {
@ -46,12 +46,12 @@ const LinkedList = (function () {
} else { } else {
let currentNode = this.head let currentNode = this.head
// Loop till there is node present in the list // Loop till there is a node present in the list
while (currentNode.next) { while (currentNode.next) {
currentNode = currentNode.next currentNode = currentNode.next
} }
// Adding node to the end of the list // Adding node at the end of the list
currentNode.next = node currentNode.next = node
} }
// Increment the length // Increment the length