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.
reverse-traversal
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
