My name is Brigt and I am at the time of writing completing my 3. semester of an Algorithms master. The topic of this blog post will be one of my favorite algorithms, namely Ternary Search. After the ...

The ternary search tree (TST) is the champion of data structure acrobatics — it finds all keys having a given prefix, suffix, or infix. It even finds those keys that closely match a given pattern. You ...

Note: The binary search tree implementation follows the structure provided in the course lectures, where it was referred to as "B-tree" in the jupyter notebook. In a ternary search tree, functions ...