Avatar of Ali B
Ali B
Flag 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.
AlgorithmsJava

Avatar of undefined
Last Comment
phoffric

8/22/2022 - Mon
ozo

ASKER CERTIFIED SOLUTION
phoffric

Log in or sign up to see answer
Become an EE member today7-DAY FREE TRIAL
Members can start a 7-Day Free trial then enjoy unlimited access to the platform
Sign up - Free for 7 days
or
Learn why we charge membership fees
We get it - no one likes a content blocker. Take one extra minute and find out why we block content.
Not exactly the question you had in mind?
Sign up for an EE membership and get your own personalized solution. With an EE membership, you can ask unlimited troubleshooting, research, or opinion questions.
ask a question
Experts Exchange has (a) saved my job multiple times, (b) saved me hours, days, and even weeks of work, and often (c) makes me look like a superhero! This place is MAGIC!
Walt Forbes