[Haskell-beginners] about Data.BinaryTree
daniel.is.fischer at web.de
Mon Dec 29 01:06:26 EST 2008
Am Montag, 29. Dezember 2008 04:22 schrieb Liu Jian:
> Hi All,
> Is there any implementation of binary tree in haskell library? for
> example, "insert lookup empty adjust isEmpty delete" including in
Well, depending on your use-case, it might be worth looking at Data.Set and
Data.Map, they're implemented via binary trees.
There's an AVL-tree imlementation in
And generally a lot of data structures on Hackage, suffix-trees,
There should be something that suits your needs.
More information about the Beginners