#include
#include
#include
#include
using?namespace?std;
template?
class?BST_Tree;??????????//樹的聲明?
template
class?Node???????????????//定義樹節點???
{
??friend?class?BST_Tree;
??private:
?????T?item;
?????Node*LChild*RChild;//左指針右指針?
??public:
?????Node（const?T&item1Node*L=NULLNode*R=NULL）:item（item1）LChild（L）RChild（R）{}??????????????????
};
template
class?BST_Tree
{
??private:
???????Node*Root;??????//樹根?
???????int?size;????????????//結點數目?
???????void?PrePrint（Node*t）const;????????//前序遍歷?
??public:
???????BST_Tree（）{Root=NULL;size=0;}
???????bool?Insert（const?T&value）;????//插入結點
???????bool?Delete（const?T&value）;?????//刪除結點?
???????//查找結點??返回查找次數??并存儲此節點的父節點???若結點不存在，則插入此節點???
???????int?FindNode（const?T&value）;?
???????void?PrePrint（）const????????//前序遍歷?
???????{
?????????PrePrint（Root）;????
???????}?
};

?template
?bool?BST_Tree::Insert（const?T&value）????//插入結點
?{
??Node*t*ParentNode*NewNode;???//結點t訪問樹??尋找合適位置??結點ParentNode為t的父節點??結點NewNode為新生成的結點
??t=Root;
??while（t!=NULL）????????//訪問不結束??繼續訪問???規則??左子樹的值比根結點值小，右子樹值比根結點大?
??{
????ParentNode=t;?????????//存儲父節點
????if（t->item>=value）???????//則訪問左子樹
?????t=t->LChild;
????else
?????t=t->RChild;?
??}?
??NewNode=new?Node（valueNULLNULL）;?????//生成新節點?
??if（Root==NULL）??????????//樹空
???Root=NewNode;
??else
???if（ParentNode->item>=value）
?????ParentNode->LChild=NewNode;
???else
?????ParentNode->RChild=NewNode;
???size++;?
??return?true;
?}

?template
?bool?BST_Tree::Delete（const?T&value）?????//刪除結點?
?{
???Node*t*ParentNode;???//結點t訪問樹??尋找合適位置??結點ParentNode為t的父節點??
???t=Root;
???//下面進行查找工作?
???while（t!=NULL）??????//樹非空繼續訪問?
????{
?????if（value==t->item）?//找到結點則結束查找?
????????????break;
?????else
?????{
?????ParentNode=?t;
?????if（valueitem）??????????//往左孩子查找?
???????t?=?t->LChild;
?????else?
???????t?=?t->RChild;?????????????//往右孩子查找?
?????}????????
????}
???if（t==NULL）
?????return?false;??????????
???if（t->LChild==NULL&&t->RChild==NULL）?//要刪除的為葉子結點?
???{
????if（t->item==Root->item）?????????//刪除為根結點時?
?????Root=NULL;
????else
????if（ParentNode->LChild&&ParentNode->LChild->item==value）//結點為左孩子?
???????ParentNode->LChild=NULL;
????else
???????ParentNode->RChild=NULL;
???}
???else?if（t->LChild==NULL&&t->RChild!=NULL）//要刪除的為只有單親結點?
???{
?????if（t->item==Root->item）?????????//刪除為根結點時?
???????Root=Root->RChild;????????????????????????????????
?????else
?????if（ParentNode->LChild&&ParentNode->LChild->item==value）//結點為左孩子
????????ParentNode->LChild=t->RChild;
?????else
????????ParentNode->RChild=t->RChild;??
???}
???else?if（t->LChild!=NULL&&t->RChild==NULL）//要刪除的為只有單親結點
???{
?????if（t->item==Root->item）?????????//刪除為根結點時?
???????Root=Root->LChild;????????????????????????????????
?????else
?????if（ParentNode->LChild&&ParentNode->LChild->item==value）//結點為左孩子
????????ParentNode->LChild=t

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????目錄???????????0??2012-06-27?17:58??實驗代碼\
?????文件????????7268??2012-04-27?09:48??實驗代碼\BSTTree.cpp
?????文件??????478714??2012-04-27?09:48??實驗代碼\BSTTree.exe
?????目錄???????????0??2012-06-27?17:58??實驗代碼\Kruskal\
?????文件??????????82??2012-05-30?10:31??實驗代碼\Kruskal\input.txt
?????文件????????2393??2012-05-30?10:32??實驗代碼\Kruskal\Kruskal.cpp
?????文件??????520078??2012-05-30?11:18??實驗代碼\Kruskal\Kruskal.exe
?????文件??????????68??2012-05-30?11:18??實驗代碼\Kruskal\output.txt
?????文件????????2566??2011-10-28?23:59??實驗代碼\queue.cpp
?????文件????????1049??2011-10-28?23:59??實驗代碼\queue.h
?????文件????????1149??2011-08-08?12:35??實驗代碼\SeqStack.cpp
?????文件?????????476??2011-08-08?12:26??實驗代碼\SeqStack.h
?????文件????????6449??2012-04-19?21:58??實驗代碼\二叉樹實現中綴表達式轉化為逆波蘭表達式.cpp
?????文件??????530110??2006-07-19?17:12??實驗代碼\二叉樹實現中綴表達式轉化為逆波蘭表達式.exe
?????文件????????3810??2012-05-04?21:43??實驗代碼\優先隊列與堆.cpp
?????文件??????595777??2012-05-04?21:48??實驗代碼\優先隊列與堆.exe
?????目錄???????????0??2012-06-27?17:58??實驗代碼\單源最短路徑\
?????文件?????????144??2012-05-20?21:36??實驗代碼\單源最短路徑\input.txt
?????文件?????????192??2012-05-20?21:37??實驗代碼\單源最短路徑\output.txt
?????文件????????2686??2012-05-20?21:34??實驗代碼\單源最短路徑\單源最短路徑.cpp
?????文件??????655386??2012-05-20?21:36??實驗代碼\單源最短路徑\單源最短路徑.exe
?????目錄???????????0??2012-06-27?17:58??實驗代碼\哈夫曼編譯碼器\
?????文件??????????26??2006-06-14?09:09??實驗代碼\哈夫曼編譯碼器\input1.txt
?????文件???????????7??2006-06-14?08:51??實驗代碼\哈夫曼編譯碼器\input2.txt
?????文件??????????18??2012-05-20?17:40??實驗代碼\哈夫曼編譯碼器\output.txt
?????文件????????3539??2006-06-14?09:06??實驗代碼\哈夫曼編譯碼器\哈夫曼編譯碼器.cpp
?????文件??????501661??2012-05-20?17:40??實驗代碼\哈夫曼編譯碼器\哈夫曼編譯碼器.exe
?????文件????????6269??2012-05-16?20:38??實驗代碼\圖遍歷.cpp
?????文件??????524737??2012-05-20?17:31??實驗代碼\圖遍歷.exe
?????文件????????2541??2012-04-13?08:29??實驗代碼\基于隊列實現的楊輝三角.cpp
?????文件??????592394??2012-04-13?16:25??實驗代碼\基于隊列實現的楊輝三角.exe
............此處省略27個文件信息