@shashank nope only 2k comparisions k numbers which are greater than x and k which are less than x dont think in terms of root and child
On Thu, Dec 15, 2011 at 12:57 PM, WgpShashank <shashank7andr...@gmail.com>wrote: > more clarification , why number of comparisons are 3k , because we are > looking for only those nodes which are less then x and each nodea can max 2 > childs , so tottal 3k comparisons . so it will O(3K) . > > > Thanks > Shashank > CSE , BIT Mesra > > -- > 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/-/OALJEqbuE_MJ. > > 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. > -- Sunny Aggrawal B.Tech. V year,CSI Indian Institute Of Technology,Roorkee -- 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.
