The *Gap Buffer* is a popular data structure for text editors to
represent files and editable buffers. The most famous of them probably being
GNU Emacs.

# Serie: Cool algorithms

This time, let’s talk about the *Trie*, which is a tree-based mapping
structure most often used for string keys.

To kickoff the series of posts about
algorithms and data structures I find interesting, I will be talking about my
favorite one: the *Disjoint Set*. Also known as the *Union-Find* data
structure, so named because of its two main operations: `ds.union(lhs, rhs)`

and
`ds.find(elem)`

.