Input File: largeT.txt - has words of length 6
Minimum word length: 0 (1,000,000 such words)
Words are sequence of digits.
So input contains long words.
| Symbol Table | Time to 'get' every distinct word. |
|---|---|
| BST | |
| RedBlackBST | |
| TrieST (Alphabet size: 256) | |
| LinearProbingHashST | |
| DigitsTrieST (Alphabet size: 10) |