Anonymous user
Eertree: Difference between revisions
m
added whitespace before the TOC.
m (→{{header|REXX}}: elided superfluous blanks.) |
m (added whitespace before the TOC.) |
||
Line 1:
[[Category:String algorithms]]
[[Category:Palindromes]]
{{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.<ref>[https://arxiv.org/abs/1506.04862]</ref> The data structure has commonalities to both [[suffix trie]]s and [[suffix tree]]s. ▼
▲
;Task:▼
▲;Task:
Construct an eertree for the string "eertree", then output all sub-palindromes by traversing the tree.
<br><br>
=={{header|Kotlin}}==
| |||