Question

could someone help me make a linked list in javascript, that has methods of inserting, updating element by index, deleting by index, obtaining all the elements, obtaining elements by index, I would be very grateful to you to help me :)

Answer 1

Please find code below and output screenshot at the end

function Node(value) {
this.value = value;
this.next = undefined;
}

function LinkedList() {
var head = undefined;
var length = 0;

return {
insertByValue: function(data) {
if (!data) return;

var node = new Node(data);

if (head) {
node.next = head;
}

head = node;
length++;
},
deleteByValue: function(value) {
var currentNode = head;

if (head.value === value) {
head = head.next;
return;
}

while (currentNode) {
if (currentNode.next) {
var next = currentNode.next;

if (next.value === value) {
currentNode.next = next.next;
length--;
break;
}
}

currentNode = currentNode.next;
}
},
searchByValue: function(value) {
var currentNode = head;
var foundNode = undefined;

while (currentNode) {
if (currentNode.value === value) {
foundNode = currentNode;
break;
}

currentNode = currentNode.next;
}

return foundNode;
},
get size() {
return length;
},
print: function() {
var result = [];

var currentNode = head;
while (currentNode) {
result.push(currentNode.value);

currentNode = currentNode.next;
}

return result;
},
   UpdateByIndex: function(index, value) {
       if (index > length) return;

var currentNode = head;
   var count = 0;
while (currentNode) {
if(count === index) {
           currentNode.value = value;
       }
       count++;
currentNode = currentNode.next;
}
   },
   deleteByIndex: function(index) {
var currentNode = head;
   var count = 0;
while (currentNode) {
       if (index == 0) {
           head = head.next;
           return;
       }
  
       if (currentNode && currentNode.next) {
           var next = currentNode.next;
           count++;
           if (index === count) {
               currentNode.next = next.next;
               length--;
               break;
           }
           }

           currentNode = currentNode.next;
}
},
   getByIndex: function(index) {
var currentNode = head;
var foundNode = undefined;
   var count = 0;
   if(index > length) return;
  
while (currentNode) {
  
if (index === count) {
foundNode = currentNode;
break;
}
       count++;
currentNode = currentNode.next;
}

return foundNode;
}
}
}