> Alists can sometimes be more efficient if the keys are sorted
according to frequency, with the most heavily accessed keys appearing
at the front of the list
You can also get this with splay trees, and then you get some of your other nice tree behaviours like faster inserts, immutability potential, etc