JavaScript Algorithms and Data Structures: Linked Lists - Reverse Traversal

Reverse traversal is a traversal algorithm that visits each node in a linked list in reverse order, starting from the tail. Learn how to implement reverse traversal in JavaScript.

The task is to traverse the given linked list in reversed order.

For example for the following linked list:

The order of traversal should be:

37 → 99 → 12

The time complexity is O(n) because we visit every node only once.

Reference

• Wikipedia

The Original Article can be found on https://github.com

#javascript #algorithms #datastructures #linkedlists