Prefix tree for O(m) string insert/search and O(p+k) prefix queries; ideal for autocomplete and dictionary membership.
/plugin marketplace add Pavel-Kravchenko/Bioinformatics
The exact command may vary by repository. Check the README on GitHub.
For the skill author
Shows your skill is listed on Skillteca, generates a backlink and trackable traffic.
[](https://www.skillteca.com.br/skills/algo-tries?utm_source=badge&utm_medium=readme&utm_campaign=badge)
Resources to assist in writing various internal communications, adhering to company-preferred formats. Claude should utilize this skill for status reports, leadership updates, newsletters, FAQs, and other internal documents.
Monitors a pull request or review cycle until it is ready to merge. This skill is used to track PR comments, reviews, and CI status until all actionable issues are resolved.
Execute a phased implementation plan using subagents. Use when asked to execute, run, or carry out a plan — especially one created by make-plan.
Token-optimized structural code search using tree-sitter AST parsing. Use this instead of reading full files when you need to understand code structure, find functions, or explore a codebase efficiently.
Category alert
One short email with only the new DevOps e Infra skills. 4 minutes of reading, no spam, unsubscribe with one click.
You confirm your email on the first send. No spam. Unsubscribe with one click.
Each node = one character. Path root→node = prefix. is_end marks word boundaries.
| Operation | Time | Notes |
|---|---|---|
| Insert | O(m) | m = word length |
| Search (exact) | O(m) | |
| Prefix check | O(p) | p = prefix length |
| Prefix collect | O(p + k) | k = results |
| Delete | O(m) |
vs Hash Table: trie has O(p + k) prefix search vs O(n × m) scan; hash is usually lower memory for exact lookup.
c
[Description truncada. Veja o README completo no GitHub.]