Link to home
Start Free TrialLog in
Avatar of Ali B
Ali BFlag for Australia

asked on

compressed trie construction linear algorithm

I have a java code that has one method that constructs a compressed prefix tree in order to have less time complexity with search method.
The construct method takes O(n*n) which is ok until I heard that it might be possible to have the construction works in linear time.
Is that really possible?  Any resources and sample code is appreciated with points.
Avatar of ozo
Flag of United States of America image

Avatar of phoffric

Link to home
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
Start Free Trial