Description: 1. Experiment established orderly table, using a binary search to achieve a known keyword search. 2. Randomly generated a set of keywords, binary sort tree insertion the build binary sort tree algorithm, and then delete a specified keyword elements. 3. Known hash function H (key) = key p (p is a constant custom) conflict handling methods were linear detection method and outside zipper method, set up the hash table and Find a designated keyword element.
To Search:
File list (Check if you may need any files):
check.doc
Download