hokey@plus5.UUCP (03/08/86)
In V3 Knuth, chapter 6.3, problem 4, there is a compressed version of a trie. Basically, a trie table of 360 elements was compressed into a table of 55 entries. However, I have found no explanation of how the compression was performed. Any help on unlocking the mystery of the compression algorithm would be greatly appreciated. -- Hokey ..ihnp4!plus5!hokey 314-725-9492