Recently I’ve been working on a Trie implementation and I was a surprised and delighted from the simplicity of the data structure. The first time I came across the Trie data structure, I was looking to solve a problem where a typeahead field had a really large dictionary to query…

Recently, I found myself trying to implement a mechanism, able to evaluate expressions. Essentially what I needed was a binary expression tree. I used Go for this project, and quickly came to a delightful surprise that using Go’s extremely powerful interface mechanisms, it became extremely easy to implement and extend. Before we dive in …