Eertree: Difference between revisions
Content added Content deleted
(added a ;See also (with accompanying text for the URL).) |
m (split a line in the task's preamble.) |
||
| Line 3: | Line 3: | ||
{{draft task}} |
{{draft 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. |
||
The data structure has commonalities to both [[suffix trie]]s and [[suffix tree]]s. |
|||