Requirements: This assignment has two tasks where two programs have to be modified: Task 1: complete all of the uncompleted functions in Tree.c Task2: complete all of the uncompleted functions in FlightDb.c

// Implementation of the Flight DB ADT #include #include #include #include "FlightDb.h" #include "List.h" #include "Tree.h" //#include "Tree.c" typedef struct flightDb *FlightDb; struct flightDb { Tree T1; //by flight number Tree T2; //by time Tree T3; //by all }; int compareFlightNumber(Record R1, Record R2) { return(strcmp(RecordGetFlightNumber(R1), RecordGetFlightNumber(R2))); } int compareFlightTime(Record R1, Record R2) { int d = RecordGetDepartureDay(R1) - RecordGetDepartureDay(R2); if(d != 0) { return d; } int h = RecordGetDepartureHour(R1) - RecordGetDepartureHour(R1); if(h != 0) { return h; } int m = RecordGetDepartureMinute(R1) - RecordGetDepartureMinute(R2); if(m != 0) { return m; } return 0; } int compareFlight(Record R1, Record R2) { int x = strcmp(RecordGetFlightNumber(R1), RecordGetFlightNumber(R2)); if(x != 0) { return x; } int d = RecordGetDepartureDay(R1) - RecordGetDepartureDay(R2); if(d != 0) { return d; } int h = RecordGetDepartureHour(R1) - RecordGetDepartureHour(R1); if(h != 0) { return h; } int m = RecordGetDepartureMinute(R1) - RecordGetDepartureMinute(R2); if(m != 0) { return m; } return 0; } FlightDb DbNew(void) { FlightDb db = (FlightDb)malloc(sizeof(struct flightDb)); db->T1 = TreeNew(compareFlightNumber); db->T2 = TreeNew(compareFlightTime); db->T3 = TreeNew(compareFlight); return db; } void DbFree(FlightDb db) { TreeFree(db->T1, false); TreeFree(db->T2, false); TreeFree(db->T3, false); } bool DbInsertRecord(FlightDb db, Record r) { return (TreeInsert(db->T1, r) && TreeInsert(db->T2, r) && TreeInsert(db->T3, r) ); } /////////////////////////// List DbFindByFlightNumber(FlightDb db, char *flightNumber) { return ListNew(); } List DbFindByDepartureAirportDay(FlightDb db, char *departureAirport, int day) { return ListNew(); } List DbFindBetweenTimes(FlightDb db, int day1, int hour1, int min1, int day2, int hour2, int min2) { return ListNew(); } Record DbFindNextFlight(FlightDb db, char *flightNumber, int day, int hour, int min) { return NULL; }

Requirements: This assignment has two tasks where two programs have to be modified: Task 1: complete all of the uncompleted functions in Tree.c Task2: complete all of the uncompleted functions in

Get Instant Homework HelpOn Your Mobile

Get Instant Homework HelpOn Your Mobile

Get Instant Homework HelpOn Your Mobile