@anshu can middle element can be found if the no. of nodes are not given...
On Tue, Sep 27, 2011 at 8:34 PM, vikas <[email protected]> wrote: > a simple one is rabit-tortoise method, and using stackless traversal, > facing a lot of corner cases in coding this, can someone check this as > well? > > On Sep 27, 6:41 pm, anshu mishra <[email protected]> wrote: > > its not o(n) it is O(max height of tree) :P > > i have not seen the constraint. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- *Dheeraj Sharma* -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
