well converting single linked list to balanced BST...this would also work On Mon, Jun 4, 2012 at 4:29 PM, Nishant Pandey <nishant.bits.me...@gmail.com > wrote:
> Hi , > > I think the only possiblity is to make it doubly linked list and then > consider next & prev as left and right child like tree and then perform > search as we in tree , it would serve the purpose . > let me know if iam wrong . > > On Mon, Jun 4, 2012 at 3:51 PM, SANDEEP CHUGH <sandeep.aa...@gmail.com>wrote: > >> can be done using skip lists >> >> >> On Mon, Jun 4, 2012 at 3:03 PM, Jeevitesh >> <jeeviteshshekha...@gmail.com>wrote: >> >>> This is possible only if Linked List is sorted then we can apply Merge >>> Sort for Linked List which would be in place. >>> >>> Otherwise the time complexity would be O(n logn). >>> >>> On Mon, Jun 4, 2012 at 3:00 PM, VIHARRI <viharri....@gmail.com> wrote: >>> >>>> Hi we need find a node in linked list in O(logn). You can change the >>>> list as u like. >>>> >>>> -- >>>> You received this message because you are subscribed to the Google >>>> Groups "Algorithm Geeks" group. >>>> To view this discussion on the web visit >>>> https://groups.google.com/d/msg/algogeeks/-/vSoEXlaRTEIJ. >>>> To post to this group, send email to algogeeks@googlegroups.com. >>>> To unsubscribe from this group, send email to >>>> algogeeks+unsubscr...@googlegroups.com. >>>> For more options, visit this group at >>>> http://groups.google.com/group/algogeeks?hl=en. >>>> >>> >>> >>> >>> -- >>> *Thanks, >>> Jeevitesh Shekhar Singh.* >>> >>> >>> -- >>> 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 >>> algogeeks+unsubscr...@googlegroups.com. >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> -- >> 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 >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Cheers, > > Nishant Pandey |Specialist Tools Development | > npan...@google.com<gvib...@google.com> | > +91-9911258345 > > > -- > 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
