Data Structures and Algorithms Lecture Notes
27 April 2011 • Hashing In Practice
This assumes the bst requires, at a minimum, the same amount of space as an array to store the word list: a block of encoded data and the indexes into the encoded-data block.
This page last modified on 2006 January 24.