Hi All,

      Is there any implementation of binary tree in haskell library?
for example,
 "insert   lookup  empty  adjust   isEmpty  delete" operators  in it.

   cheers,

   Liu Jian
 ----
 email to: [email protected]
_______________________________________________
Haskell mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell

Reply via email to