This assignment aims to help you practice binary search tree ADT, in particular AVL Tree. You will

write a program that can be used to analyze the collected fish data. You will use this application

to index the fish.

Requirements:

In this assignment, you are given a list of fishes in an external text file called "fishes.txt$".$ In this text

file, you can find several fishes.

This file includes the following information:

Name: the name of the fish

Weight: weight of the fish in grams

Length: length of the fish in $cm$

Date: the fishing date

City: the fishing city

And sample data is as follows where each part is separated by a $",$ character:

Name, Weight,Date,City

Beam,$242,23\mathrm{.}2,02/02/2022,$city$1$

Whitefish, $270,23\mathrm{.}6,22/02/2022,$ city$2$

Roach,$40,12\mathrm{.}9,15/09/2022,$city $3$

Parkki,$300,26\mathrm{.}0,15/09/2022,$cify$4$

Whitefish,$270,24\mathrm{.}1,15/09/2022$;city $3$

Parkki,$300,26\mathrm{.}5,18/09/2022,$cify$5$

Your task here is to process this file and generate an AVL tree based on the weight. If there is

more than one fish with the same weight, they should then be stored together in the same node

as shown below.