| Current Forum: Homework 3 Forum |
| Date: Sun Sep 30 2001 6:25 pm |
| Author: Lee, Charles C. <chucklee@cmu.edu> |
| Subject: Re: Maximum size of Trie |
|
|
Each internal node can have n children where n is the number of characters in the alphabet. *in hw3, the number is 256 for the number of ascii characters. Therefore, each node can have at most 256 children. That doesn't change.
As for the height of the trie, it depends on the longest string in the text file and not on the size of the text file. |
|