use c++ to answer the folloing two question 1. implement a city database using a BST to store the database records. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as integer x- and y-coordinates. The BST should be organized by city name. Your database should allow records to be inserted, deleted by name or coordinate, and searched by name or coordinate. Another operation that should be supported is to print all records within a given distance of a specified point. Use following two classes: struct city { /* add the city attributes and pointers to left and right child nodes*/ } class CityDB { /* create a BST for a City Database here in this class */ } Note: The distance formulais > \«: «-w »* , where x1y1 are coordinates of city 1 and x2, y2 are coordinates of city 2. 2.Create the same City Database that you created in the first question using Hash table. Add another attribute in the City record, that is, city_id. Use city_id to compute the hashing. Implment member functions to insert, delete, search and display city records. Use the chained hashing to resolve the collision issue.
use c++ to answer the folloing two question
1.
implement a city
coordinates of the city expressed as integer x- and y-coordinates. The BST should be organized by city name. Your database should allow records to be inserted, deleted
by name or coordinate, and searched by name or coordinate. Another operation that should be supported is to print all records within a given distance of a specified
point.
Use following two classes:
struct city
{
/* add the city attributes and pointers to left and right child nodes*/
}
class CityDB
{
/* create a BST for a City Database here in this class */
}
Note: The distance formulais > \«: «-w »* , where x1y1 are coordinates of city 1 and x2, y2 are coordinates of city 2.
2.Create the same City Database that you created in the first question using Hash table. Add another attribute in the City record, that is, city_id. Use city_id to compute the
hashing. Implment member functions to insert, delete, search and display city records. Use the chained hashing to resolve the collision issue.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 4 images
