Okasaki says the following on his homepage: "This is a revised and
expanded version of my thesis. New data structures include red-black
trees, splay trees, pairing heaps, leftist heaps, tries, and Hood-
Melville queues. I also provide numerous exercises, as well as Haskell
translations of each of the major data structures." I haven't really
looked over the thesis version, but it seems like if you want
exercises and new data structures then you ought go for the print
version.
The Haskell source shouldn't be much of a deciding factor as code from
the book is available for SML, Haskell and Ocaml from Chris' homepage
(http://www.eecs.usma.edu/webs/people/okasaki/pubs.html#cup98).
The OCaml link is broken there, but I found the translations here:
http://hg.ocaml.info/release/pure-fun/file/37539a12a560
Phil
I bought the Powell's Tech copy a couple weeks back. :p
Also, I'd love to work through the book in Scala, but I would really
like to come out of this book knowing Haskell reasonably well. It'd
be pretty awesome to have Scala source for this book, though, just to
have a large comparison of Scala and Haskell/Ocaml code. It could be
a really good showcase of functional Scala.