Need BST Algorithms and File I/O.
BST Algorithms:
• Insert
• Delete
• Traversals
– Inorder
– Indented Tree
Note: add The hidden menu option is to display the indented tree, and display the team member’s name(4 persons: Luke Skywalker, Dark Vader, Baby Yoda, Han Solo).
File I/O:
• Determine Hash Size (count the lines in the input file, multiply it by 2, and choose the next prime number).
• Read data from the input file and insert them into the hash table and BST
• Save to file (in hash table sequence)
-Re–hashing
– – When load factor is 75%, allocate another hash table (2 * actual size, and choose the next prime number), then
– – Traverse the hash table and hash each item into the new table using the same hash function and collision resolution method, and delete the old hash table)
0 comments