# Reversed Linked List Traversal

_Read this in other languages:_
[_中文_](README.zh-CN.md),
[_Português_](README.pt-BR.md)

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

For example for the following linked list: 

![](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg)

The order of traversal should be:

```text
37 → 99 → 12
```

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

## Reference

- [Wikipedia](https://en.wikipedia.org/wiki/Linked_list)