Unfortunately, when a MWT is sparse, it$\text{'}$ can waste a lot of space. The Ternary Search Tree $($TST$)$ is essentially the combination of a MWT and a BST$,$ and it can be useful for contexts in which we would want to use a MWT $($e$.$g$.$ spell$-$checking and autocompletion$)$ but don't have enough memory.

Question A

Imagine we have the followir

Giro

What are all of the strings contained within this TST$?$ List the strings in increasing alphabetical order, with a single string per line.