Timeline for MaxHeap-like data structure supporting max AND min, also decrease-key (yes decrease-key)
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 12:40 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| May 4, 2015 at 17:20 | comment | added | AK_ | Also you should look at binomial and Fibonacci heaps | |
| May 4, 2015 at 17:16 | comment | added | AK_ | To compare performance we need specific data structures to compare. There are several kinds of search trees and heeps. I like BSTs for two reasons: 1. There are lots of good ready libraries and ready implementations. 2. BSTs give an ordered structure and allow you to do many manipulations on them at ~O(logn) | |
| May 4, 2015 at 13:06 | comment | added | Snowbody | Could you explain what benefit the balanced binary tree has? Simpler code, runtime? I don't need it to be more useful in general, just able to support the operations I have listed. Seems to me that a plain ol binary heap has better performance. | |
| May 2, 2015 at 14:53 | history | edited | AK_ | CC BY-SA 3.0 |
added 123 characters in body
|
| May 2, 2015 at 14:36 | comment | added | Stefan Pochmann | Looks like you forgot a link in your P.S. | |
| May 2, 2015 at 12:31 | comment | added | AK_ | @HonzaBrabec Obviously sometimes a Heap is the best solution. But I can't recall ever requiring a "Priority Queue", when I didn't need to be able to search the data, nor hold it in sorted form (for presentation and the sort)... | |
| May 2, 2015 at 12:25 | history | edited | AK_ | CC BY-SA 3.0 |
added 7 characters in body
|
| May 2, 2015 at 12:05 | comment | added | Honza Brabec | Really? Never used priority queue in real life? | |
| May 2, 2015 at 10:43 | history | answered | AK_ | CC BY-SA 3.0 |