@Karthikeyan:
I want linear time solution not nlogn
On 1 December 2011 23:42, Karthikeyan V.B kartmu...@gmail.com 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)
--
1) In there any way to remove duplicates in Integer array in linear time
using constant space??
i dont want the Hash based solution
2) Is there anyway to remove the duplicates elements from an unsorted
linked list in * Single Pass*???
--
Regards
Kumar Raja
M.Tech(SIT)
IIT Kharagpur,
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
