[algogeeks] Re: Linking sibling in a binary tree

I fail to understand though does it have any significance to the question being asked. Or may be i miss something which is very obvious :). -K Mohammad Moghimi wrote: > in what order? can you give an example? > > On 3/27/06, kalyan <[EMAIL PROTECTED]> wrote: > > > > > > Hi, > > > > I was wonder

[algogeeks] Re: Linking sibling in a binary tree

in what order? can you give an example?On 3/27/06, kalyan <[EMAIL PROTECTED]> wrote: -- -- Mohammaddo you C?!! double m[] = { 9580842103863.650391, 133470973390.236450, 270};int main(){m[2]--?m[0]*=4,m[1]*=5,main():printf(m);} --~--~-~--~~~---~--~~ You received this

[algogeeks] Re: Inscription test run problems

With regards to the first problem, it is pretty easy if you can have all the primes precomputed. As a matter of fact, if you search the net, you'll find the list of all prime no.s that can be stored as a 4 byte unsigned integer !!. Just use that list of primes to find out the nearest with the help

[algogeeks] Linking sibling in a binary tree

Hi, I was wondering if there is any method to link all sibling nodes in a binary tree thanks --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@