[algogeeks] Re: Linking sibling in a binary tree

[kalyan]

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 wondering if there is any method to link all sibling nodes in a
> > binary tree
> >
> > thanks
> >
> >
> >
> >
>
>
> --
> -- Mohammad
> do you C?!!
> double m[] = { 9580842103863.650391, 133470973390.236450, 270};
> int main(){m[2]--?m[0]*=4,m[1]*=5,main():printf(m);}
>
> ------=_Part_8588_13151344.1143495949983
> Content-Type: text/html; charset=ISO-8859-1
> Content-Transfer-Encoding: quoted-printable
> X-Google-AttachSize: 581
>
> in what order? can you give an example?<br><br><div><span 
> class="gmail_quote">On 3/27/06, <b class="gmail_sendername">kalyan</b> &lt;<a 
> href="mailto:[EMAIL PROTECTED]">[EMAIL PROTECTED]</a>&gt; 
> wrote:</span><blockquote class="gmail_quote" style="border-left: 1px solid 
> rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
> <br><br></blockquote></div><br><br clear="all"><br>-- <br>-- Mohammad<br>do 
> you C?!! <br>double m[] = { 9580842103863.650391, 133470973390.236450, 
> 270};<br>int main(){m[2]--?m[0]*=4,m[1]*=5,main():printf(m);}
> 
> ------=_Part_8588_13151344.1143495949983--


--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---