Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 3d2cfb9

Browse files
committed
Do
1 parent b7017ed commit 3d2cfb9

File tree

11 files changed

+67
-35
lines changed

11 files changed

+67
-35
lines changed

‎src/data-structures/heap/README.fr-FR.md‎

Lines changed: 6 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,11 +4,15 @@ En informatique, un **tas** est une structure de données arborescente spéciali
44

55
Dans un *tas minimal* (en anglais *min heap*), si `P` est un nœud parent de `C`, alors la clé (la valeur) de `P` est inférieure ou égale à la clé de `C`.
66

7-
![MinHeap](https://upload.wikimedia.org/wikipedia/commons/6/69/Min-heap.png)
7+
![MinHeap](./images/min-heap.jpeg)
8+
9+
*Made with [okso.app](https://okso.app)*
810

911
Dans un *tas maximal* (en anglais *max heap*), la clé de `P` est supérieure ou égale à la clé de `C`.
1012

11-
![Heap](https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg)
13+
![MaxHeap](./images/max-heap.jpeg)
14+
15+
![Array Representation](./images/array-representation.jpeg)
1216

1317
Le nœud au «sommet» du tas sans parents est appelé le nœud racine.
1418

‎src/data-structures/heap/README.ja-JP.md‎

Lines changed: 6 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,11 +4,15 @@
44

55
*最小ヒープ*では、もし`P`が`C`の親ノードの場合、`P`のキー(値)は`C`のキーより小さい、または等しくなります。
66

7-
![MinHeap](https://upload.wikimedia.org/wikipedia/commons/6/69/Min-heap.png)
7+
![MinHeap](./images/min-heap.jpeg)
8+
9+
*Made with [okso.app](https://okso.app)*
810

911
*最大ヒープ*では、`P`のキーは`C`のキーより大きい、もしくは等しくなります。
1012

11-
![Heap](https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg)
13+
![MaxHeap](./images/max-heap.jpeg)
14+
15+
![Array Representation](./images/array-representation.jpeg)
1216

1317
ヒープの「トップ」のノードには親ノードが存在せず、ルートノードと呼ばれます。
1418

‎src/data-structures/heap/README.ko-KR.md‎

Lines changed: 6 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,11 +4,15 @@
44

55
*최소 힙*에서 `P`가 `C`의 상위 노드라면 `P`의 키(값)는 `C`의 키보다 작거나 같습니다.
66

7-
![MinHeap](https://upload.wikimedia.org/wikipedia/commons/6/69/Min-heap.png)
7+
![MinHeap](./images/min-heap.jpeg)
8+
9+
*Made with [okso.app](https://okso.app)*
810

911
*최대 힙*에서 `P`의 키는 `C`의 키보다 크거나 같습니다.
1012

11-
![Heap](https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg)
13+
![MaxHeap](./images/max-heap.jpeg)
14+
15+
![Array Representation](./images/array-representation.jpeg)
1216

1317
상위 노드가 없는 힙의 "상단"에 있는 노드를 루트 노드라고 합니다.
1418

‎src/data-structures/heap/README.md‎

Lines changed: 6 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -17,12 +17,16 @@ In a *min heap*, if `P` is a parent node of `C`, then the
1717
key (the value) of `P` is less than or equal to the
1818
key of `C`.
1919

20-
![MinHeap](https://upload.wikimedia.org/wikipedia/commons/6/69/Min-heap.png)
20+
![MinHeap](./images/min-heap.jpeg)
21+
22+
*Made with [okso.app](https://okso.app)*
2123

2224
In a *max heap*, the key of `P` is greater than or equal
2325
to the key of `C`
2426

25-
![Heap](https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg)
27+
![MaxHeap](./images/max-heap.jpeg)
28+
29+
![Array Representation](./images/array-representation.jpeg)
2630

2731
The node at the "top" of the heap with no parents is
2832
called the root node.

‎src/data-structures/heap/README.pt-BR.md‎

Lines changed: 6 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -6,12 +6,16 @@ baseada em uma árvore especializada que satisfaz a propriedade _heap_ descrita
66
Em um *heap mínimo* (min heap), caso `P` é um nó pai de `C`, então a chave
77
(o valor) de `P` é menor ou igual a chave de `C`.
88

9-
![MinHeap](https://upload.wikimedia.org/wikipedia/commons/6/69/Min-heap.png)
9+
![MinHeap](./images/min-heap.jpeg)
10+
11+
*Made with [okso.app](https://okso.app)*
1012

1113
Em uma *heap máximo* (max heap), a chave de `P` é maior ou igual
1214
a chave de `C`.
1315

14-
![Heap](https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg)
16+
![MaxHeap](./images/max-heap.jpeg)
17+
18+
![Array Representation](./images/array-representation.jpeg)
1519

1620
O nó no "topo" do _heap_, cujo não possui pais, é chamado de nó raiz.
1721

‎src/data-structures/heap/README.ru-RU.md‎

Lines changed: 6 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,11 +4,15 @@
44
если B является узлом-потомком узла A, то ключ(A) ≥ ключ(B). Из этого следует, что элемент с наибольшим ключом всегда
55
является корневым узлом кучи, поэтому иногда такие кучи называют max-кучами.
66

7-
![Max-куча](https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg)
7+
![MaxHeap](./images/max-heap.jpeg)
8+
9+
![Array Representation](./images/array-representation.jpeg)
810

911
Если сравнение перевернуть, то наименьший элемент будет всегда корневым узлом, такие кучи называют min-кучами.
1012

11-
![Min-куча](https://upload.wikimedia.org/wikipedia/commons/6/69/Min-heap.png)
13+
![MinHeap](./images/min-heap.jpeg)
14+
15+
*Made with [okso.app](https://okso.app)*
1216

1317
Не существует никаких ограничений относительно того, сколько узлов-потомков имеет каждый узел кучи. На практике их
1418
число обычно не более двух. Куча является максимально эффективной реализацией абстрактного типа данных, который

‎src/data-structures/heap/README.tr-TR.md‎

Lines changed: 8 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -4,15 +4,19 @@ Bilgisayar biliminde, **yığın (heap)** aşağıda açıklanan özellikleri ka
44

55
*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.
66

7-
![MinHeap](https://upload.wikimedia.org/wikipedia/commons/6/69/Min-heap.png)
7+
![MinHeap](./images/min-heap.jpeg)
88

9-
*max heap*, `P`'nin anahtarı `C`'nin anahtarından büyük veya eşittir.
9+
*Made with [okso.app](https://okso.app)*
1010

11-
![Heap](https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg)
11+
*max heap*, `P`'nin anahtarı `C`'nin anahtarından büyük veya eşittir.
12+
13+
![MaxHeap](./images/max-heap.jpeg)
14+
15+
![Array Representation](./images/array-representation.jpeg)
1216

1317
Yığının (Heap) "en üstündeki" ebeveyni olmayan düğüme kök düğüm (root node) denir.
1418

1519
## Referanslar
1620

1721
- [Wikipedia](https://en.wikipedia.org/wiki/Heap_(data_structure))
18-
- [YouTube](https://www.youtube.com/watch?v=t0Cq6tVNRBA&index=5&t=0s&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)
22+
- [YouTube](https://www.youtube.com/watch?v=t0Cq6tVNRBA&index=5&t=0s&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)
Lines changed: 23 additions & 19 deletions
Original file line numberDiff line numberDiff line change
@@ -1,19 +1,23 @@
1-
# 堆 (数据结构)
2-
3-
在计算机科学中, 一个 **堆(heap)** 是一种特殊的基于树的数据结构,它满足下面描述的堆属性。
4-
5-
在一个 *最小堆(min heap)* 中, 如果 `P` 是 `C` 的一个父级节点, 那么 `P` 的key(或value)应小于或等于 `C` 的对应值.
6-
7-
![最小堆](https://upload.wikimedia.org/wikipedia/commons/6/69/Min-heap.png)
8-
9-
在一个 *最大堆(max heap)* 中, `P` 的key(或value)大于 `C` 的对应值。
10-
11-
![堆](https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg)
12-
13-
14-
在堆"顶部"的没有父级节点的节点,被称之为根节点。
15-
16-
## 参考
17-
18-
- [Wikipedia](https://en.wikipedia.org/wiki/Heap_(data_structure))
19-
- [YouTube](https://www.youtube.com/watch?v=t0Cq6tVNRBA&index=5&t=0s&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)
1+
# 堆 (数据结构)
2+
3+
在计算机科学中, 一个 **堆(heap)** 是一种特殊的基于树的数据结构,它满足下面描述的堆属性。
4+
5+
在一个 *最小堆(min heap)* 中, 如果 `P` 是 `C` 的一个父级节点, 那么 `P` 的key(或value)应小于或等于 `C` 的对应值.
6+
7+
![M最小堆](./images/min-heap.jpeg)
8+
9+
*Made with [okso.app](https://okso.app)*
10+
11+
在一个 *最大堆(max heap)* 中, `P` 的key(或value)大于 `C` 的对应值。
12+
13+
![堆](./images/max-heap.jpeg)
14+
15+
![Array Representation](./images/array-representation.jpeg)
16+
17+
18+
在堆"顶部"的没有父级节点的节点,被称之为根节点。
19+
20+
## 参考
21+
22+
- [Wikipedia](https://en.wikipedia.org/wiki/Heap_(data_structure))
23+
- [YouTube](https://www.youtube.com/watch?v=t0Cq6tVNRBA&index=5&t=0s&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)
109 KB
Loading[フレーム]
78.5 KB
Loading[フレーム]

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /