二叉排序樹的尋找、刪除、插入

#include<iostream><br />using namespace std;<br />typedef int KeyType;<br />struct BSTree<br />{<br />KeyType key;<br />BSTree *lchild,*rchild;<br />};<br />BSTree *InitBSTNode()<br />{<br />BSTree *T=NULL;<br />return T;<br />}<br />BSTree *InsertBST(BSTree *T,KeyType k)<br />{<br />BSTree *p=T;<br />BSTree *f=p;//用來暫存當前尋找的節點<br />while(p)<br />{<br />if(p->key==k)<br />return T;<br />f=p;<br />p=(k<p->key)?p->lchild:p->rchild;<br />}<br />p=new BSTree;<br />p->key=k;<br />p->lchild=p->rchild=NULL;<br />if(T==NULL)<br />T=p;<br />else<br />{<br />if(k<f->key)<br />f->lchild=p;<br />else<br />f->rchild=p;<br />}<br />return T;<br />}<br />void TravesBST(BSTree *T)<br />{<br />if(T)<br />{<br />TravesBST(T->lchild);<br />cout<<T->key<<" ";<br />TravesBST(T->rchild);<br />}<br />}<br />BSTree *SearchBST(BSTree *T,KeyType k)<br />{<br />if(!T||k==T->key)<br />return T;<br />else<br />{<br />if(k<T->key)<br />return SearchBST(T->lchild,k);<br />else<br />return SearchBST(T->rchild,k);<br />}<br />}<br />BSTree *DelBST(BSTree *T,KeyType k)<br />{<br />BSTree *p=T,*f=NULL;<br />while(p)<br />{<br />if(p->key==k)<br />break;<br />f=p;<br />p=(k<p->key)?p->lchild:p->rchild;<br />}<br />if(!p)<br />return T;<br />if(!p->lchild)<br />{<br />if(p==T)<br />T=p->rchild;<br />else<br />{<br />if(f->lchild==p)<br />f->lchild=p->rchild;<br />else<br />f->rchild=p->rchild;<br />}<br />delete p;<br />}<br />return T;<br />}<br />int main()<br />{<br />BSTree *T=InitBSTNode();<br />T=InsertBST(T,32);<br />T=InsertBST(T,26);<br />T=InsertBST(T,45);<br />T=InsertBST(T,35);<br />T=InsertBST(T,12);<br />T=InsertBST(T,20);<br />TravesBST(T);<br />cout<<endl;<br />cout<<"尋找12結果："<<endl;<br />if(SearchBST(T,12)==NULL)<br />cout<<"沒找到"<<endl;<br />else<br />cout<<"找到"<<endl;<br />cout<<"尋找23結果:"<<endl;<br />if(SearchBST(T,23)==NULL)<br />cout<<"沒找到"<<endl;<br />else<br />cout<<"找到了"<<endl;<br />cout<<"刪除26"<<endl;<br />T=DelBST(T,26);<br />TravesBST(T);<br />cout<<"刪除22"<<endl;<br />T=DelBST(T,22);<br />TravesBST(T);</p><p>return 0;<br />}