´´½¨¶þ²æÅÅÐòÊ÷µÄÎÊÌâ(ÆäËü°å¿éûÈË»Ø)

©¬¨Ýai©‰‡†¶ù

´´½¨¶þ²æÅÅÐòÊ÷µÄÎÊÌâ
#include<iostream>
using namespace std;
typedef struct Tree{
struct Tree *lchild,*rchild;
int data;
}TNode,*BiTree;
BiTree Search(BiTree T,int data,BiTree f,BiTree &p)
{// f³õʼֵÊÇNULL£¬ Ö¸ÏòTµÄË«Ç×
if(!T) p = f;
else if( T->data == data) p = T;
else if( T->data < data ) return Search(T->lchild,data,T,p);
else return Search(T->rchild,data,T,p);
}
void insert(BiTree &T,int data)
{
BiTree p,s;
if(!Search(T,data,NULL,p))
{
s = (BiTree)malloc(sizeof(TNode));
s->data = data; s->lchild = s->rchild = NULL;
if(!p) T = s;
else if(p->data > data) p->lchild = s;
else p->rchild = s;
}
}
void creatBiTree(BiTree &T)
{
int data;
do{
cin>>data;
insert(T,data);
}while(data!=0);
}
void printBiTree(BiTree &T)
{
if(T)
{
cout<<T->data<<endl;
printBiTree(T->lchild);
printBiTree(T->rchild);
}
}
int main()
{
BiTree t;
creatBiTree(t);
printBiTree(t);
system("pause");

§°oË®Á÷Ó°ÔÚ.

ÄãµÄÄ¿µÄÊÇ×öʲô°¡£¿

À¼¹ðèÊ

µÝ¹é×öµÄÓÐʲôÒâÒ壿ÊéÉÏÓÐÈ«²¿´úÂë¡£

°®ÇétpÆòؤ

BiTree Search(BiTree T,int data,BiTree f,BiTree &p)
{// f³õʼֵÊÇNULL£¬ Ö¸ÏòTµÄË«Ç×
if(!T) p = f;
else if( T->data == data) p = T;
else if( T->data < data ) return Search(T->lchild,data,T,p);
else return Search(T->rchild,data,T,p);
}
Õâ¸öÓ¦¸ÃÒªÓзµ»ØÖµ°É

Çå²èµ­Ë®

СµÜ³õ³ö鮣¬²»ÖªµÀÄÜ·ñ°ïÎÒ½â¾öÎÊÌ⣬Íò·Ö¸Ðл°¡£¡
Ï£ÍûÓбà³ÌµÄ¸ßÊÖÄܽâ¾öÎÒµÄÒÉÄÑ°¡

¤´Çã³Ç¨KÁµ

ÔõôÕÒ³öÀ´µÄÄØ Åå·þ