int main()
{
BTreeNode *bt;
char *b;
ElemtType x,*px;
InitBTree(&bt);
b = "c(a(d,e),b)";
CreateBTree(&bt, b);
/*
if (bt != NULL) {
printf("%c", bt->data);
}
*/
printf("preorder\n");
PreOrder(bt);printf("\n");
printf("inorder\n");
InOrder(bt);printf("\n");
printf("postorder\n");
PostOrder(bt);printf("\n");
printf("levelorder\n");
LevelOrder(bt);printf("\n");
printf("find one root\n");
scanf("%c",&x);
px = FindBTree(bt, x);
if (px) {
printf("find it !: %c\n",*px);
}
else{
printf("not find it\n");
}
printf("the depth of bt is \n");
printf("%d\n",BTreeDepth(bt));
ClearBTree(&bt);
return 0;
}
int main()
{
pBTNode pT = CreateBTree();
PreTraverseTree(pT);
return 0;
}
int _tmain(int argc, _TCHAR* argv[])
{
PBTNode pT = CreateBTree();
PreTraverseBTree(pT);
InTraverseBTree(pT);
PostTraverseBTree(pT);
system("pause");
return 0;
}
int main(void)
{
FILE *f = tmpfile();
assert(f != NULL);
int fd = fileno(f);
ALLOC allocator;
ALLOC *a = &allocator;
assert(init_allocator(a, fd, 0) != 0);
assert(init_allocator(a, fd, O_CREAT) == 0);
assert(fsize(fd) == FLT_LEN);
BTree bt;
handle_t root = CreateBTree(&bt, a, 1, 4, cmpInt);
int i;
for(i = 1; i <= 100000; i++) {
SetKey(&bt, &i, i);
//output(&bt);
//getchar();
}
return 0;
for(i = 1; i <= 10000; i++) {
DeleteKey(&bt, &i, 100000-i+1);
}
return 0;
}
extern "C"__declspec(dllexport) void __stdcall CreateIndex()
{
CreateBTree(secondNameBTree);
CreateBTree(adressBTree);
CreateBTree(numberBTree);
}
