compressed trie construction linear algorithm

Ali B
Ali B used Ask the Experts™
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.
Watch Question

Do more with

Expert Office
EXPERT OFFICE® is a registered trademark of EXPERTS EXCHANGE®
Most Valuable Expert 2014
Top Expert 2015


Do more with

Expert Office
Submit tech questions to Ask the Experts™ at any time to receive solutions, advice, and new ideas from leading industry professionals.

Start 7-Day Free Trial