All Questions
3 questions
6
votes
2
answers
2k
views
Is there any particular reason for the use of lists over queues in functional programming languages?
Most functional programming languages such as Scheme and Haskell use lists as their main data structure. Queues are identical to lists, except for the fact appending to the end - not to the begin - ...
- 5,850
26
votes
2
answers
4k
views
What's the difference in content between Chris Okasaki's 1996 thesis and 1999 book, Purely Functional Data Structures? [closed]
I want to read Purely Functional Data Structures. I've easily found the thesis (which is freely available as a PDF), but see that there's a book available also. So I'd like to know what the ...
23
votes
6
answers
19k
views
Which self balancing binary tree would you recommend?
I'm learning Haskell and as an exercise I'm making binary trees. Having made a regular binary tree, I want to adapt it to be self balancing. So:
Which is most efficient?
Which is easiest to implement?
...
- 7,327