A while ago I wrote a "tables" UDF, for doing look-up tables (unique key=value). As I've worked with them, I've wanted one that are faster, and will be sorted when displayed. I also wanted a quick way to search an array, without having to sort it everytime I add something to it. If you don't know how Binary Trees work, don't worry about it. Just think of it this way: instead of having a flat array where the indexes are 0-x, you can have whatever indexes you want. For example: ;Create a bin