Mateus Pfeffer da6ae08851
Brazilian Portuguese translation and typos fixes (#943)
* Update README.pt-BR.md

* TRIE README.pt-BR typo

* TREE README.pt-BR typo

* Stack README.pt-BR typo

* Priority Queue README.pt-BR typo

* hash-table README.pt-BR typo

* doubly-linked-list README.pt-BR typo

* disjoint-set README.pt-BR typo

* bloom-filter README.pt-BR typo

* merge-sort pt-BR translation

* merge-sort README added pt-BR option

* insertion sort pt-BR translation

* insertion sort README added pt-br option

* heap-sort pt-BR translation

* heap-sort READMED added pt-BR option

* bubble sort pt-BR typo

* pt-BR translation for sorting algorithms

Fixed typos and translated all the missing algorithms

* Update README.pt-BR.md

* linked list pt-BR translation

* ml pt-BR translation

* fix typo in README

Co-authored-by: Oleksii Trekhleb <trehleb@gmail.com>
2022-10-10 15:23:32 +02:00
..
2020-12-17 09:49:57 +01:00
2022-01-22 10:21:37 +01:00

Linked List Traversal

Read this in other languages: Русский, 中文, Português

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

For example for the following linked list:

Singly linked list

The order of traversal should be:

12 → 99 → 37

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

Reference