Hi im new to Haskell (really just learning). Im trying to code a function to take in a List of Strings (e.g.) [apple, orange, banana, orange, apple, orange] , and create a binary search tree containing the Strings and integers (where the integers are the number of occurrences of each word. I then wish to use this to output the number of words that are repeated and the maximum number of repetitions. (e.g.) in the example above the output would be:
2 words repeated Max number of 3 repetitions Because apple and orange are the two that are repeated and orange is repeated three times. Any help would be appreciated, thankyou Lizz Ross _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
