Questions about Trie
M. Faisal Fariduddin Attar Nasution
farkinas@cbn.net.id
Thu, 17 May 2001 23:21:26 +0700
This is a multi-part message in MIME format.
------=_NextPart_000_0007_01C0DF28.18AAB360
Content-Type: text/plain;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
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.
Aerith Gainsborough (Final Fantasy VII)
"All I know is..."=20
"The Cetra were born from the Planet, speak with the Planet, and=20
unlock the Planet."=20
"And....... then......"=20
"The Cetra will return to the Promised Land. A land that promises =
supreme happiness."=20
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
M. Faisal Fariduddin Attar Nasution
-----------------------------------
farkinas@cbn.net.id
------=_NextPart_000_0007_01C0DF28.18AAB360
Content-Type: text/html;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=3DContent-Type content=3D"text/html; =
charset=3Diso-8859-1">
<META content=3D"MSHTML 5.50.4134.100" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV align=3Djustify><FONT face=3DArial size=3D2> =
Greeting, I'm a=20
last year student in a computer science field. I'm currently trying to =
code an=20
implementation for a compression using basic Lempel-zif technique. I use =
a Trie=20
(retrieval) as a data structure for the dynamic dictionary =
aplication. The=20
problem is Trie uses not just an ordinary binary tree, but it uses a=20
multiple-weighted tree, where one node has at most 256 children. Most=20
literatures about Haskell show only binary tree for the example in tree =
or=20
Abstract Data Structures subject. So, does anyone know how to code the=20
implementation for trie. Thanks for paying attention and I'm really =
hoping for=20
the answer immediately.</FONT></DIV>
<DIV><FONT face=3DArial size=3D2></FONT> </DIV>
<DIV><FONT face=3DArial size=3D2>Aerith Gainsborough (Final Fantasy =
VII)<BR>"All I=20
know is..." <BR>"The Cetra were born from the Planet, speak with the =
Planet, and=20
<BR>unlock the Planet." <BR>"And....... then......" <BR>"The Cetra will =
return=20
to the Promised Land. A land that promises supreme happiness."=20
<BR>=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D<BR>M. Faisal Fariduddin Attar=20
Nasution<BR>-----------------------------------<BR><A=20
href=3D"mailto:farkinas@cbn.net.id">farkinas@cbn.net.id</A><BR></FONT></D=
IV></BODY></HTML>
------=_NextPart_000_0007_01C0DF28.18AAB360--