Skip to content

Latest commit

 

History

History
22 lines (13 loc) · 491 Bytes

File metadata and controls

22 lines (13 loc) · 491 Bytes

Reversed Linked List Traversal

Read this in other languages: 中文

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