what is a good general purpose binary search tree library in haskell? We have Data.List for lists, Data.Set for sets and Data.Map for maps, what is the equivalent for search trees.
Thanks, Chris
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Data.Mapis implemented as a balanced binary search tree.