**? ? ? ? ? ? ** **B-Trees
**struct Record
{
? ? ? ? ? ? ? int status;? ? ? ? ? ? ? ? ? ? ?
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? int EmployeeID;
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? char Name[30];
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? char position[10];
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? float salary;
}
Create a data file called EmployeeData which will store employee records with above format. An index is defined for the data in
EmployeeData. The index should be based on B-Tree method The indexing should be based on the (EmployeeID). The B-Tree should be of order [login to view URL] do not need to write the index data in the file. Assume Employee ID is unique and the data file is in a pile format.?
? Find a record? Employee ID
·? ? ? ? ? ? ? ? Insert a record?
Delete a record Employee ID