AVL & Hashing

in JAVA LANGUAGE PLEASE :) Building a data structure for countries visa applications data

Step 1: build a sample data file that contains countries visa applications records in the following format: Country_Nme / Country_VISA_related_data_file_name (e.g. Germany / Germany.txt )

Step 2: using the data file created in step 1, build an AVL tree of countries nodes (use country name as key). Step 3: implement the following functions on countries AVL tree:

Print out countries sorted.

Search for a specific country

Insert a new country record.

Delete a specific country record.

Calculate tree height.

Save Tree back to file.

Step 4: using the Country_VISA_related_data_file_name that stored in each tree country node, load the visa data that stored in each file. The visa record data format in these files is as follow:

Passport_#/Full_name/Age/Gender/ Intended_date_of_arrival/ Intended_date_of_departure

(e.g. 289332/Mamoun Nawahdah/40/M/26\4\2016/2\5\2016)

Step 4: create a Hash Table using the country visa data from step 4. Step 5: implement the following functions on country visa hash table:

Print hashed table (including empty spots).

Print out table size.

Print out used hash function.

Insert a new visa record to hash table.

Search for a specific visa record.

Delete a specific visa record.

Save hash table back to file.

thank you :)