On Mon, 2008-12-29 at 11:20 +0800, Liu Jian wrote: > Hi All, > > Is there any implementation of binary tree in haskell library? > for example, > "insert lookup empty adjust isEmpty delete" operators in it.
Data.Set is implemented using ordered balanced binary trees. Is that what you mean? jcc _______________________________________________ Haskell mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell
