tstbtree.cpp

this is a Implementation of a B* tree,not yet completed, because I need help for this task.

//tstbtree.cc
#include <iostream>
#include <time.h>
#include <stdlib.h>

#include "btree.h"
#include <string>

const int BTreeSize = 3;


 char * keys1 = 
"D1XJ2xTg8zKL9AhijOPQcEowRSp0NbW567BUfCqrs4FdtYZakHIuvGV3eMylmn";
 char * keys2 = 
"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz裱";
 char * keys3 = 
"袲YZakHIUwxVJ203ejOP9Qc8AdtuEop1XvTRghSNbW567BfiCqrs4FGMyz馣Llmn";


main (int argc, char * argv)
{
	int result, i;
	BTree  bt (BTreeSize);
	for (i = 0; keys1[i]; i++)
	{
		//cout<<"Inserting "<<keys1[i]<<endl;
		result = bt.Insert(&keys1[i], i*i);
		//bt.Print(cout);
	}
	bt.Print(cout);
	/*for (i = 0; keys2[i]; i++)
	{
		cout << "Searching " << keys2[i] << " ";
		long ObjID = bt.Search(keys2[i]);
 		if( ObjID != -1 )
			cout << "Encontrado " << keys2[i] << " ID = " << ObjID << endl;
		else
			cout <<"No Encontrado!" << keys2[i] << endl;
	}*/
	cout.flush();

	for (i = 0; keys3[i]; i++)
	{
		cout << "Removing " << keys3[i] << " ";
		if( bt.Remove(&keys3[i], -1) )
 			cout << keys3[i] << " removido !" << endl;
		else
			cout <<"Nao achei!" << keys3[i] << endl;
		bt.Print(cout);
	}
	bt.Print(cout);
	cout.flush();
	return 1;
}