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.
