Anonymous user
Eertree: Difference between revisions
promoted to (full) task status.
(Added Java) |
(promoted to (full) task status.) |
||
Line 1:
[[Category:String algorithms]]
[[Category:Palindromes]]
{{
An '''eertree''' is a data structure designed for efficient processing of certain palindrome tasks, for instance counting the number of sub-palindromes in an input string.
Line 7:
The data structure has commonalities to both ''tries'' and ''suffix trees''.
See links below.
;Task:
| |||