# JavaScript Exercises: Count number of nodes in a Singly Linked List

## JavaScript Singly Linked List: Exercise-3 with Solution

Write a JavaScript program to create a singly linked list of n nodes and count the number of nodes.

Sample Solution:

JavaScript Code:

class Node {
constructor(data) {
this.data = data
this.next = null
}
}

}
if(node==null){
return;
}
while (node.next) {
node = node.next;
}
node.next = newNode;}
NodeCount() {
let ctr = 0;
while (node) {
ctr++;
node = node.next;
}
return ctr;
}
displayList(){
var str = ""
while (node) {
str += node.data + "->";
node = node.next;
}
str += "NULL"
console.log(str);
}
}
numList.displayList();
var ctr = numList.NodeCount();
console.log("Number of elements in the said Linked list: "+ctr)

Sample Output:

2->3->4->5->6->7->NULL
Number of elements in the said Linked list: 6

Flowchart:

Live Demo:

See the Pen javascript-singly-linked-list-exercise-3 by w3resource (@w3resource) on CodePen.

Improve this sample solution and post your code through Disqus

Singly Linked List Previous: Print a singly linked list in reverse order.
Singly Linked List Next: Insert a new node at any position of a Singly Linked List.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

﻿

## JavaScript: Tips of the Day

Shorten an array using its length property

A great way of shortening an array is by redefining its length property.

let array = [0, 1, 2, 3, 4, 5, 6, 6, 8, 9]
array.length = 4
// Result: [0, 1, 2, 3]

Important to know though is that this is a destructive way of changing the array. This means you lose all the other values that used to be in the array.

Ref: https://bit.ly/2LBj213