I have been given a project on implementing a B-tree in C++ in which a huge array of strings of length 50 is used to simulate a Hard drive sector. The const string length=1000.
The project I have to do is pretty much insert, delete, search, print (preorder and postorder traversal), and do what my manager calls a "garbage collector", where it is a linked list of free items.
I have done a previous assignment from my old college day but it does not seem to be working. I don't want to post my code on here since people will start taking it for their class homeworks and whatnot so I am ready to e-mail this code out to anyone who want to takle this thing with me. PLEASE SOMEONE HELP ME!!!!!!!!!!!