Timeline for (Min)Heap implementation
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 13, 2016 at 16:25 | history | edited | 200_success | CC BY-SA 3.0 |
deleted 63 characters in body
|
| May 13, 2016 at 16:00 | answer | added | JanDotNet | timeline score: 3 | |
| May 13, 2016 at 15:35 | comment | added | Gentian Kasa |
@JNS a heap is a binary tree (you can see it as a special type of graph though) with a certain relation (see previous comment) among parent and child nodes. By managing it through a linear structure (the List in this case) you just have to arrange the indices of the nodes. See GetChildrenIndices and GetParentIndex for the rule on how the indices are arranged. This page may be more helpful than the previous.
|
|
| May 13, 2016 at 14:55 | comment | added | Gentian Kasa | @JNS a heap is a data structure you could use to implement a priority queue. Depending on the relation between parent and child nodes (greater than or equal to, or the opposite) you have max heaps or min heaps. Here you can find a description of a min heap or max heap. | |
| May 13, 2016 at 14:48 | comment | added | JanDotNet | Is a min-heap equivalent to a priority queue? If not could you please explain (or provide a link) how exactly a min-heap behaves? | |
| May 13, 2016 at 12:37 | history | asked | Gentian Kasa | CC BY-SA 3.0 |