JavaScript Linked List

A singly linked list is a linear data structure with elements pointing to the next node.

A singly linked list stores elements in an array.

In a singly linked list, each node contains a reference to the previous node.

A singly linked list supports backward traversal without additional memory.

{data: 10, prevNode: null}

{nodeValue: 10, nextNode: null}

{value: 10, prevNode: null}

{value: 10, nextNode: null}

forEach()

map()

next()

while loop (traversing by moving from node to node)

An error will be thrown.

It will return null or undefined.

The program will crash.

It will result in an infinite loop.

O(1)

O(n)

O(log n)

O(n^2)

pop()

shift()

delete()

Traverse through the list and set the second-last node’s next pointer to null

Data and reference to the next node only.

Data and reference to both the next and previous node.

Only data.

Data, next node, and reference to the previous node, but in a single direction.

By swapping the data of the nodes.

By deleting all nodes and creating a new list in reverse order.

By reversing the next pointers of the nodes.

By converting the linked list to an array and then reversing it.

Check if the last node points to null.

Traverse through the list and check if the node’s next points back to a previous node.

Check if the nodes contain references to themselves.

There is no way to check for a loop.

O(n)

O(1)

O(log n)

O(n^2)