Greeting, I'm a last year student in a computer science field. I'm currently trying to code an implementation for a compression using basic Lempel-zif technique. I use a Trie (retrieval) as a data structure for the dynamic dictionary aplication. The problem is Trie uses not just an ordinary binary tree, but it uses a multiple-weighted tree, where one node has at most 256 children. Most literatures about Haskell show only binary tree for the example in tree or Abstract Data Structures subject. So, does anyone know how to code the implementation for trie. Thanks for paying attention and I'm really hoping for the answer immediately.
There is some relevant material in Chapter 6 (Text compression) of `Applications of Functional Programming', UCL Press, 1995. ISBN: 1-85728-377-5. (With apologies for self-reference, as co-editor of the book.) Colin R