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

docs: add README.tr-TR.md (#833)

Browse Source 
* docs: added Turkish translation of Heap (data structures) algorithm

* docs: removed other languages section from translation file

Co-authored-by: Oleksii Trekhleb <trehleb@gmail.com>
This commit is contained in:
Elif 2022-01-22 12:05:55 +03:00 committed by GitHub
parent 3372666d32
commit 5cb7e38299
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 20 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
src/data-structures/heap/README.md
View File

@ -5,7 +5,8 @@ _Read this in other languages:_
[_Русский_](README.ru-RU.md),
[_日本語_](README.ja-JP.md),
[_Français_](README.fr-FR.md),
[_Português_](README.pt-BR.md)
[_Português_](README.pt-BR.md),
[_Türkçe_](README.tr-TR.md)
In computer science, a **heap** is a specialized tree-based
data structure that satisfies the heap property described

18
src/data-structures/heap/README.tr-TR.md Normal file
View File

@ -0,0 +1,18 @@
# Heap (data-structure)
Bilgisayar biliminde, **yığın (heap)** aşağıda açıklanan özellikleri karşılayan ağaç tabanlı(tree-based) özel bir veri yapısıdır.
*min heap*, Eğer `P`, `C`'nin üst düğümü ise, `P`'nin anahtarı (değeri) `C`'nin anahtarından (değerinden) küçük veya ona eşittir.
![MinHeap](https://upload.wikimedia.org/wikipedia/commons/6/69/Min-heap.png)
*max heap*, `P`'nin anahtarı `C`'nin anahtarından büyük veya eşittir.
![Heap](https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg)
Yığının (Heap) "en üstündeki" ebeveyni olmayan düğüme kök düğüm (root node) denir.
## Referanslar
- [Wikipedia](https://en.wikipedia.org/wiki/Heap_(data_structure))
- [YouTube](https://www.youtube.com/watch?v=t0Cq6tVNRBA&index=5&t=0s&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)