fa717e8a6f
Create a suffix tree from an input string. This implementation uses a stack to control the flow of the program. I expected this attempt to be easier than my first attempt, but surprisingly, it was similarly difficult. It took me ~30-45 minutes to successfully implement this function, and I'm still not pleased with the final result. |
||
---|---|---|
.. | ||
binary-adder.py | ||
fisher-yates.py | ||
random-choice.py | ||
suffix-tree.py |