This is a fast, non-recursive implementation of a splay tree data structure in JavaScript, adapted from Wikipedia with an API similar to AVL trees. It's designed for developers who need an efficient self-balancing binary search tree with operations like insertion, deletion, lookup, bulk loading, and range queries, supporting both duplicate and unique keys.