This paper presents an original version of Splay Tree for lossless compression, a selfadjusting form of binary search trees. It is developed and analyzed in its new form, and then is compared in terms of text compression performance to other algorithms and transforms.

Keywords: Data compression, Splay Tree, Prefix, Compression ratio.