# Linked List ## Linked List Traversal *Read this in other languages:* *Русский* The task is to traverse the given linked list in straight order. For example for the following linked list: ![Singly linked list](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg) The order of traversal should be: ``` 12 → 99 → 37 ``` The time complexity is `O(n)` because we visit every node only once. ### Reference * [Wikipedia](https://en.wikipedia.org/wiki/Linked_list) --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://bryan-guner.gitbook.io/my-docs/data-structures-and-algorithms/graph/linked-list.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.