@Kumar: What makes you think that there is an O(n) time, O(1) space algorithm?
Dave On Dec 2, 6:26 am, kumar raja <[email protected]> wrote: > @Karthikeyan: > I want linear time solution not nlogn > > On 1 December 2011 23:42, Karthikeyan V.B <[email protected]> wrote: > > > > > > > Hi, > > > Create a binary search tree with elements , while inserting check for > > equal elements and delete it. > > > But for insertion of n elements in a BST takes O(nlogn) > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to [email protected]. > > To unsubscribe from this group, send email to > > [email protected]. > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en. > > -- > Regards > Kumar Raja > M.Tech(SIT) > IIT Kharagpur, > [email protected] -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
