All geek questions in one place

Look for a good introduction to trie

I am looking for a good introduction / tutorial on Tries .
Most of the links that I find for search are too succinct and abstract for me, or too trivial.
Can someone please provide me a good link with Java examples so that I can learn?

thanks

+6
source share
5 answers

I recently coded Trie and Patricia Trie in Java. They are written to be easy to follow. All data structures were built from their descriptions on Wikipedia.

Associated classes: Radix Trie , Suffix Trie , Trie Map .

If you have any questions, feel free to ask.

+1
source

Googling found this blog with a series of Java articles.

But I would recommend buying a textbook. Many of the Java-oriented books on data structures and algorithms are available from your favorite online bookstore.

+2
source

Of course, check out Steve Khanov ’s website , for example Levenshtein’s Fast and Easy distance using Trie .

+1
source

I recommend Stefan Nilson, Ph.D. thesis from 1996, Sorting and searching by Radix (the search part is what you are looking for.) It is quite easy to read for a research publication and contains many theories and practices about attempts.

The examples are in C, not Java, but it shouldn't be difficult for you to understand them if you know Java.

0
source

This topcoder link to trie was found to be quite useful:

http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=usingTries

0
source

Source: https://habr.com/ru/post/916246/

More articles:


All Articles