hi again!
I have this college project that I must deliver monday, and I'm supposed to build a program that allows the user to add names to a linked list. This list must be sorted using a b-tree. Afterwards, the user must have the possibility to select any name from the sorted list and the program has to return the node number that the selected name is in. The user should also have the possibility to remove any name from the list. Naturally, the list must be reorganized, every time the user decides to remove a name.I really could use some help in inplementing this as I have no idea where to start. Can anybody help me?
I have this college project that I must deliver monday, and I'm supposed to build a program that allows the user to add names to a linked list. This list must be sorted using a b-tree. Afterwards, the user must have the possibility to select any name from the sorted list and the program has to return the node number that the selected name is in. The user should also have the possibility to remove any name from the list. Naturally, the list must be reorganized, every time the user decides to remove a name.I really could use some help in inplementing this as I have no idea where to start. Can anybody help me?
