資源簡介
該源碼使用C實現了最二叉查找樹的基本操作,比如刪除、查找,插入等。
代碼片段和文件信息
#include?
#include?“searchtree.h“
int?main(int?argc?char?*argv[])
{
????int?i?=?0;
????char?a[12]?=?{1023452648562212042};
????nodePtr?tmpPtr;
????tree?t?=?NULL;
????for(i?=?0;i?12;++i)
????{
????????SearchTreeInsert(a[i]&t);
????}
????tmpPtr?=?FindMax(t);
????if(tmpPtr?!=?NULL)
????{
????????printf(“Max:%d\n“tmpPtr->element);
????}
????tmpPtr?=?FindMin(t);
????if(tmpPtr?!=?NULL)
????{
????????printf(“Min:%d\n“tmpPtr->element);
????}
????tmpPtr?=?Find(6t);
????if(tmpPtr?!=?NULL)
????{
????????printf(“6?frequecy?is?%d\n“tmpPtr->frequency);
????}
????deleteTreeNode(6&t);
????tmpPtr?=?Find(6t);
????if(tmpPtr?!=?NULL)
????{
????????printf(“6?frequecy?is?%d\n“tmpPtr->frequency);
????}
????deleteTreeNode(10&t);
????tmp
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????目錄???????????0??2016-06-14?09:43??searchTree\
?????文件????????1494??2016-06-14?09:42??searchTree\main.c
?????文件????????5153??2016-06-14?09:31??searchTree\searchtree.c
?????文件?????????662??2016-06-13?22:02??searchTree\searchtree.h
評論
共有 條評論