troubleshooting Question

compressed trie construction linear algorithm

Avatar of Ali B
Ali BFlag for Australia asked on
JavaAlgorithms
2 Comments1 Solution840 ViewsLast Modified:
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.
ASKER CERTIFIED SOLUTION
phoffricSoftware Engineering and Matlab Analyst

Our community of experts have been thoroughly vetted for their expertise and industry experience.

Join our community to see this answer!
Unlock 1 Answer and 2 Comments.
Start Free Trial
Learn from the best

Network and collaborate with thousands of CTOs, CISOs, and IT Pros rooting for you and your success.

Andrew Hancock - VMware vExpert
See if this solution works for you by signing up for a 7 day free trial.
Unlock 1 Answer and 2 Comments.
Try for 7 days

”The time we save is the biggest benefit of E-E to our team. What could take multiple guys 2 hours or more each to find is accessed in around 15 minutes on Experts Exchange.

-Mike Kapnisakis, Warner Bros