Timeline for Which self balancing binary tree would you recommend?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 17, 2016 at 8:55 | history | edited | user541686 | CC BY-SA 3.0 | added 50 characters in body |
| Jan 1, 2011 at 14:53 | comment | added | Fanatic23 | @dan_waterworth my bad, you are correct. | |
| Jan 1, 2011 at 14:12 | comment | added | dan_waterworth | @Fanatic23, a Skip List isn't an ADT. The ADT is either a set or an associative array. | |
| Jan 1, 2011 at 14:08 | comment | added | dan_waterworth | Also, people often use skiplists for concurrent data structures. It may be better, instead of forcing immutability, to use haskell's concurrency primitives (like MVar or TVar). Although, this won't teach me a lot about writing functional code. | |
| Jan 1, 2011 at 13:57 | comment | added | dan_waterworth | I really enjoy skip lists and I've implemented them before, though not in a functional language. I think I'll attempt them after this, but right now I'm on self-balancing trees. | |
| Jan 1, 2011 at 13:47 | history | answered | Matthieu M. | CC BY-SA 2.5 |