Ok then answer must be both of them :) actually finding min is O(1) but to re-heapify after deletion is log(n).
On Mon, Aug 22, 2011 at 9:55 AM, Amol Sharma <amolsharm...@gmail.com> wrote: > BST should be the answer......agree with the reason by dumanshu > -- > > > Amol Sharma > Third Year Student > Computer Science and Engineering > MNNIT Allahabad > <http://gplus.to/amolsharma99> > <http://twitter.com/amolsharma99><http://in.linkedin.com/pub/amol-sharma/21/79b/507><http://youtube.com/amolsharma99> > > > > > > On Mon, Aug 22, 2011 at 6:52 AM, Akash Mukherjee <akash...@gmail.com>wrote: > >> ay that the "re-heapify" is implicit just as the "re-balance" is im > > > -- > 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. > -- **Regards SAGAR PAREEK COMPUTER SCIENCE AND ENGINEERING NIT ALLAHABAD -- 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.
