Skip to content

Latest commit

 

History

History
23 lines (14 loc) · 526 Bytes

File metadata and controls

23 lines (14 loc) · 526 Bytes

Reversed Linked List Traversal

Read this in other languages: 中文, Português

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