COMPRESS.C says "This implementation uses multiple binary trees to speed up the search for the
longest match", but it didn't describe how to construct those trees and how they work.