Anonymous user
Eertree: Difference between revisions
added a ;See also (with accompanying text for the URL).
m (added whitespace before the TOC.) |
(added a ;See also (with accompanying text for the URL).) |
||
Line 3:
{{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.
;Task:
Construct an eertree for the string "eertree", then output all sub-palindromes by traversing the tree.
;See also:
* [https://arxiv.org/abs/1506.04862 Cornell University Library, Computer Science, Data Structures and Algorithms ───► EERTREE: An Efficient Data Structure for Processing Palindromes in Strings].
<br><br>
Line 518 ⟶ 522:
Sub-palindromes: L("e","r","eertree","ertre","rtr","t","ee")
</pre>
| |||