if I do two traversals of a tree inorder wise i can get it in O(n). Questions should be one traversal i think . Then we should use a tree where nodes contain links to parents.
On Tue, Jul 13, 2010 at 6:58 PM, sharad kumar <sharad20073...@gmail.com>wrote: > Find the median in B-tree of order n > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- *D.S.Naveen Trainee Engineer SQA* *My Blog: **http://www.naveends.blogspot.com*<http://www.naveends.blogspot.com> -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
