A good hash function has uniform distribution and low amount of collisions. Use of mod is common. Hash table is constant average case search time, whereas binary tree will take O(log n).