What would be the most efficient algorithm to use for an index file for an modifiable dictionary database (where words can be inserted or removed)? Factors to be considered: searching speed, addition/deletion speed, index file size etc. Algorithms to be considered: binary search tree, binary heap, ......... ?
Please help! Thanks, MN -- For information on using the Palm Developer Forums, or to unsubscribe, please see http://www.palmos.com/dev/support/forums/
