Eertree: Difference between revisions
Content added Content deleted
(Added Java) |
(promoted to (full) task status.) |
||
Line 1: | Line 1: | ||
[[Category:String algorithms]] |
[[Category:String algorithms]] |
||
[[Category:Palindromes]] |
[[Category:Palindromes]] |
||
{{ |
{{task}} |
||
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. |
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: | Line 7: | ||
The data structure has commonalities to both ''tries'' and ''suffix trees''. |
The data structure has commonalities to both ''tries'' and ''suffix trees''. |
||
See links below. |
See links below. |
||
;Task: |
;Task: |