This assignment is based on a simplified version of a real world problem. It is not uncommon to be asked to produce applications similar to this in industry, normally as a pilot study. It is not uncommon for files to differ slightly from the provided specification making error trapping important, however that isnt the case with this file.
A large multinational trading company has acquired a flat data file of economic data for different countries. You have been asked to create an application that will store and structure this data to allow fast and efficient searching (and other functionality) via the country name. You are to implement a Binary Search or AVL tree, where each node corresponds to a specific country and its economic data. The application must be able to read this data from csv file documents (an example is provided on moodle) where each line in the file corresponds to a unique country. For a bare pass the builtin Dictionary collection can be used instead (though obviously much of the search functionality will be suboptimal). Your trees MUST use the recursive techniques covered in the lectures and labs as a starting point.
The first line of the file consists of the following headings:
Country,GDP growth,Inflation,Trade Balance,HDI Ranking,Main Trade Partners
Other lines consist of the data which falls under each heading, for example:
USA,1.8,2,-3.1,4,[Canada;UK;Brazil]
Note that the last field (Trade Partners) is a list of country names separated by ; and enclosed in [ ]. This field will contain an arbitrary (varying) number of countries.
You must implement an application with a GUI (may be multiple forms) which allows the user to :