hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-09-20 07:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Translate Linked List Traversal to Russian (#283)

Browse Source 
Co-authored-by: Askhat <caelestes961@gmail.com>
This commit is contained in:
Askhat Arslanov 2020-12-17 11:40:05 +03:00 committed by GitHub
parent 07c21083d6
commit 431560a4e5
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 23 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
src/algorithms/linked-list/traversal/README.md
View File

@ -1,8 +1,11 @@
# Linked List Traversal # Linked List Traversal
_Read this in other languages:_
[_Русский_](README.ru-RU.md)
The task is to traverse the given linked list in straight order. The task is to traverse the given linked list in straight order.
For example for the following linked list: For example for the following linked list:
![](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg) ![](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg)

19
src/algorithms/linked-list/traversal/README.ru-RU.md Normal file
View File

@ -0,0 +1,19 @@
# Обход связного списка
Задача состоит в том, чтобы обойти связный список в прямом порядке.
Например, для следующего связного списка:
![](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg)
Порядок обхода будет такой:
```text
12 → 99 → 37
```
Временная сложность - `O(n)`, потому что мы посещаем каждый узел только один раз.
## Ссылки
- [Wikipedia](https://ru.wikipedia.org/wiki/%D0%A1%D0%B2%D1%8F%D0%B7%D0%BD%D1%8B%D0%B9_%D1%81%D0%BF%D0%B8%D1%81%D0%BE%D0%BA)