well... i can't find the ideals from the internet. all of the resources are not useful to me. but anyway, thanks for help .... i have done with my ownself, wanna see ?
Originally posted by quzah
Seriously, Beely, this is like the third time in as many days that you've asked a similar question. And every single time, you're referred to do a search and make some actual effort on your part. You'd think you'd learn by now...
void breadth_first_search (DataType x, TREE T)
if(T != NULL && !Stop)
if(Count == T->Level)
if(x == T->Data)
printf("\n\nSummary : Node %d is in level %d", T->Data, T->Level);
Stop = 1;
breadth_first_search (x, T->Left);
breadth_first_search (x, T->Right);