TrieSuite

One data structure. Four real-world applications.

Trie Aho-Corasick Binary Trie · LPM Segment Trie Python · DSA Project

🔤

Trie Autocomplete Engine

Prefix search O(L+K) · Levenshtein fuzzy search · 160-word dictionary

Search

Fuzzy OFF Edit distance ≤ 1

Type a prefix

160 words loaded · real-time

HOW IT WORKS

Trie traverses character-by-character to the prefix node, then collects all words in that subtree via DFS. O(L + K) vs. list scan O(n·L).

Suggestions

Start typing on the left…

🧬

DNA Pattern Matching — Aho-Corasick

Multi-pattern search in O(n+m) · single pass · failure links

Input

DNA Sequence (A, C, G, T only) Patterns (comma or newline separated)

Highlighted Sequence

Hit Run to see results…

Match Table

🌐

IP Routing — Binary Trie (Longest Prefix Match)

O(32) = O(1) lookup · same algorithm as real routers · CIDR support

Routing Table

Add Route

Network Address Subnet Mask Label

IP Lookup

Enter IP Address

HOW IT WORKS

IPv4 = 32 bits → binary Trie depth 32. Walk bits left-to-right, track the last node with a route. The deepest match wins — this is Longest Prefix Match, used in every real router.

🔗

URL Routing — Segment Trie with Wildcards

:param wildcards · exact > wildcard priority · O(D) match

Registered Routes

Add Route

URL Pattern (:param for wildcards) Handler Name

Route Matcher

Enter a URL to match

TRY THESE

/home
/user/42
/user/42/posts
/user/99/posts/15
/shop/electronics
/shop/books/python-dsa