Ali B

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.

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.

http://en.wikipedia.org/wiki/Suffix_tree

ASKER CERTIFIED SOLUTION

membership

This solution is only available to members.

To access this solution, you must be a member of Experts Exchange.