資源簡介
紅黑樹的完整代碼實現。按照算法導論給出的算法。附二叉查找樹的完整代碼。純C語言實現。
代碼片段和文件信息
#include?“binTree.h“
#include?
#include?
binTree?emptyBinTree()
{
binTree?t=malloc(sizeof(*t));
t->data=0;
t->leftChild=t->rightChild=NULL;
return?t;
}
binTree?newBinTree(int?key)
{
binTree?t=malloc(sizeof(*t));
t->data=key;
t->leftChild=t->rightChild=NULL;
return?t;
}
binTree?search(binTree?rootint?key)
{
if(!(root->data))
return?NULL;
else
{
if(key==root->data)
return?root;
if(keydata)
return?search(root->leftChildkey);
return?search(root->rightChildkey);
}
}
binTree?modifiedSearch(binTree?treeint?key)
{
binTree?t=tree;
if(t->data)
{
while(t->leftChild||t->rightChild)
{
if(key==t->data)
t=NULL;
else?
if(keydata&&t->leftChild)
t=t->leftChild;
else?
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件???????2055??2008-11-15?19:57??red-black?tree\binTree.c
?????文件????????434??2008-11-15?19:57??red-black?tree\binTree.h
?????文件???????4368??2008-12-28?13:27??red-black?tree\main.c
?????文件???????4698??2008-11-16?17:36??red-black?tree\ostree.c
?????文件????????633??2008-11-16?00:20??red-black?tree\ostree.h
?????文件???????7716??2008-11-16?17:57??red-black?tree\rbtree.c
?????文件????????785??2008-11-15?23:55??red-black?tree\rbtree.h
?????文件???????4340??2008-11-15?23:29??red-black?tree\red-black?tree.vcproj
?????文件???????1427??2008-12-28?13:32??red-black?tree\red-black?tree.vcproj.LENOVO-AC279B22.Administrator.user
?????目錄??????????0??2009-01-20?21:19??red-black?tree
-----------?---------??----------?-----??----
????????????????26456????????????????????10
- 上一篇:C語言學生管理系統C語言學生管理系統
- 下一篇:用鏈表實現一個簡單的通訊錄管理系統
評論
共有 條評論