I guess its NlogN for balanced tree as it is traversing N nodes for H times ie the height of tree which is logN for balanced and N for skewed tree. So it should be Nlogn and N^2
On Nov 20, 9:27 am, tech coder <techcoderonw...@gmail.com> wrote: > @ sravanreddy001 > complexity is O(N^2) whether tree is balanced or not doesn't matter > For each level it's visiting elements. all elements upto n-1 level . > i dont know from where u got the concept of logn , the code is not > making any decision to go in left or right , it is going in left and right > both , so how it is nlogn. > > On Sun, Nov 20, 2011 at 3:12 AM, sravanreddy001 > <sravanreddy...@gmail.com>wrote: > > > > > > > > > > > Its NlogN if balanced.. Else N^2 > > > For each element it's visiting at most log N elements.(assuming balanced) > > > -- > > 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/-/hVQH5EtOfK4J. > > 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* > *"The Coder"* > > *"Life is a Game. The more u play, the more u win, the more u win , the > more successfully u play"* -- 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.
