Simple python implementation of Trie tree data structure also known as digital tree, sometimes radix tree or prefix tree. Efficient when keeping string clues.
It was done as a part of the semester project for "Algorithms and data structers" subject on University of Warsaw.
You can use Trie as a dictionary. Dictionary implemented as a command line parser dictparser.py. Here are some commands:
i word # insert word
r word # remove word from dictionary
f word # print lexicographic number
n l # print lth word
p pref # print number of words starting with prefix pref
a # print all words in lexicographic order
d # print all words in reversed order