First of all, do you know about Okasaki leftist heaps (I suppose you do as you're asking for even more advanced data structure) ? They're simple O(log n) heap, nice to implement (~ 20 lines).
There was a page from Markus Mottl with translated OCaml code from the book, but he removed it for some obscure reason. _______________________________________________ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
