Solution for the 2022 Algoritmi per l'informatica course @ Politecnico di Milano
Solution graded 30/30. BST has been used for the storing of the main dictionary, with the support of a second BST for the filtered set of words. The main idea was to reuse a constructed list as a middle man for the copy of dictionary into a smaller and smaller tree. Space and time optimization can be achieved eliminating the middle step.