# JavaScript Exercises: Get a node in an existing singly linked list

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

Write a JavaScript program to get a node in an existing singly linked list.

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;
}
get_node(index){
if(index==0) {
}
while(index--){
if(node.next!==null)
node = node.next;
else
throw Error("Index Out of Bound");
}
return node;
}
displayList(){
var str = ""
while (node) {
str += node.data + "->";
node = node.next;
}
str += "NULL"
console.log(str);
}
}
numList.displayList();
console.log("Node details at index 0:")
console.log(numList.get_node(0));
console.log("Node details at index 2:")
console.log(numList.get_node(2));
```
```

Sample Output:

```12->13->14->15->NULL
Node details at index 0:
{"data":12,"next":{"data":13,"next":{"data":14,"next":{"data":15,"next":null}}}}
Node details at index 2:
{"data":14,"next":{"data":15,"next":null}}
```

Flowchart:

Live Demo:

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

Improve this sample solution and post your code through Disqus

Singly Linked List Previous: Insert a new node at the end of a Singly Linked List.
Singly Linked List Next: Find the first index that matches a given element.

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