資源簡介
這是數據結構最后的課程設計之一,是用C語言實現B樹的基本操作。

代碼片段和文件信息
#include
#include“BTree.h“
int?main()?{
BTree?T=NULL;
result?r;
int?choice?k?i?m?n;
do{
choice?=?menu();
if?(choice?>=?0?&&?choice?<=?7)?{
system(“cls“);//把菜單清除
switch?(choice)?{
case?1:
printf(“請輸入B樹的階數m:(3<=m<=20)\n“);
scanf_s(“%d“?&m);
printf(“請輸入B樹的初始化關鍵字個數:(0<=n<=10000)\n“);
scanf_s(“%d“?&n);
CreatBTree(T?n?m);
break;
case?2:
printf(“請輸入要查找的關鍵字:\n“);
scanf_s(“%d“?&k);
SearchBTree(T?k?r);
if?(r.tag)?{
printf(“該關鍵字的位置為該結點中第%d個關鍵字\n“r.i);
}
else?{
printf(“該關鍵字不存在!\n“);
}
break;
case?3:
printf(“請輸入要插入的關鍵字k:\n“);
scanf_s(“%d“?&k);
SearchBTree(T?k?r);
InsertBTree(T?k?(&r)->pt?(&r)->i?m);
printf(“插入成功!\n“);
break;
case?4:
printf(“請輸入要刪除B樹T上的關鍵字:\n“);
scanf_s(“%d“?&i);
SearchBTree(T?i?r);
DeleteBTree(r.pt?r.i?m?T);
printf(“刪除成功!\n“);
break;
case?5:
printf(“此時的B樹序列為:\n“);
PrintBTree(T);
printf(“\n“);
break;
case?6:
DestroyBTree(T);
printf(“銷毀成功!\n“);
break;
default:;
}
}
}while?(choice?>?0?&&?choice?7);
return?0;
}
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
????..A..H.?????31744??2016-12-18?10:16??楊宇杰_3115005372_實驗三\B樹實驗\BTree\.vs\BTree\v14\.suo
?????文件???????1593??2016-12-18?09:53??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\BTree.h
?????文件???????5825??2016-12-02?22:43??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\BTree.vcxproj
?????文件???????1168??2016-12-02?22:43??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\BTree.vcxproj.filters
?????文件???????1317??2016-12-04?09:56??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\BTree_Test.cpp
?????文件????????714??2016-12-17?09:17??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\Debug\bookinfo.dat
?????文件????????255??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\Debug\BTree.log
?????文件????????194??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\Debug\BTree.tlog\BTree.lastbuildstate
?????文件???????1114??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\Debug\BTree.tlog\CL.command.1.tlog
?????文件???????5540??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\Debug\BTree.tlog\CL.read.1.tlog
?????文件???????1506??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\Debug\BTree.tlog\CL.write.1.tlog
?????文件???????1240??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\Debug\BTree.tlog\li
?????文件???????2726??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\Debug\BTree.tlog\li
?????文件????????506??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\Debug\BTree.tlog\li
?????文件??????16302??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\Debug\BTree_Test.obj
?????文件??????32082??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\Debug\OperationDefine.obj
?????文件??????84992??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\Debug\vc140.idb
?????文件??????86016??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\Debug\vc140.pdb
?????文件???????9937??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree\OperationDefine.cpp
?????文件???????1297??2016-12-02?10:25??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree.sln
?????文件????1753088??2016-12-18?10:16??楊宇杰_3115005372_實驗三\B樹實驗\BTree\BTree.VC.db
?????文件??????45568??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\Debug\BTree.exe
?????文件?????436160??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\Debug\BTree.ilk
?????文件?????700416??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree\Debug\BTree.pdb
?????文件??????45568??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\BTree.exe
?????文件???????1593??2016-12-18?09:53??楊宇杰_3115005372_實驗三\B樹實驗\BTree.h
?????文件???????1317??2016-12-04?09:56??楊宇杰_3115005372_實驗三\B樹實驗\BTree_Test.cpp
?????文件???????9937??2016-12-18?10:14??楊宇杰_3115005372_實驗三\B樹實驗\OperationDefine.cpp
?????文件?????556654??2016-12-14?14:52??楊宇杰_3115005372_實驗三\B樹實驗\數據結構設計性實驗報告.docx
?????目錄??????????0??2016-12-18?10:18??楊宇杰_3115005372_實驗三\B樹實驗\BTree\.vs\BTree\v14
............此處省略12個文件信息
- 上一篇:學生信息管理系統 數組
- 下一篇:哈夫曼編碼與譯碼附報告
評論
共有 條評論