1088e4143d
While it took me awhile to implement, this exercise was definitely worth doing. I think there should be a more elegant way to construct the tree using maybe a stack, but I couldn't find it. All of this was part of a larger effort to search a string for a variety of patterns. The solution is to compile the string into a suffix tree and then search the suffix tree for each of the patterns. I'm glad I didn't gloss over this exercise. |
||
---|---|---|
.. | ||
binary-adder.py | ||
fisher-yates.py | ||
random-choice.py | ||
suffix-tree.py |