This includes basic control structures in Python: conditional branches, for loops and recursion; functions: defining and calling functions, and recursion; in-built data structures: lists and ...

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.