I'm having trouble coming up with a scenario where perfect hashing Vs a binary search tree is slower. Also, yes, the very nature of perfect hashing means it wi

I'm having trouble coming up with a scenario where perfect hashing Vs a binary search tree is slower. Also, yes, the very nature of perfect hashing means it will very potential need to be updated with additional keywords. However, that doesn't happen often and this is a small amount of work for what all would be entailed with a new keyword.