Often the best way to get the “feel” of a new language is to look at some real code. Preferably code that does a non-trivial task, but a task with which you are generally familiar. To this end I’m posting here the code for a binary-tree representation of a dictionary. There are three files: the … Continue reading Binary Trees in Grace