# Thread: searching node

1. ## searching node

well, i need some ideals from yours.

anyone who have ideals on the breadth-frist binary search tree by recursion technique. i can't mix the code with other function, such as bin search, depth-first search and others. i would prefer some advises and ideals (how to pointer move, what things should do.... ), i need not to have the source code. i wan have a try. pls ... thanks guys.

2. A good first step would be to study the algorithm from a google search.

-Prelude

3. well, thanks anyway prelude. thank for help

4. Maybe reading this site helps.

http://purists.org/bintree/

5. Originally posted by beely
well, thanks anyway prelude. thank for help
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...

Quzah.

6. Really liked this page

7. ## i have done it ... thanks for all

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...

Quzah.
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 ?
Code:
```void breadth_first_search (DataType x, TREE T)
{
if(T != NULL && !Stop)
{
if(Count == T->Level)
{
printf("%d", T->Data);
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);
}
}```

Popular pages Recent additions