 As an alternative to including the tree representation, the "static tree" option provides standard fixed Huffman trees.The compressed size using the static trees can be computed using the same statistics (the number of times each symbol appears) as are used to generate the dynamic trees, so it is easy for a compressor to choose whichever is smaller.During the compression stage, it is the "encoder" that chooses the amount of time spent looking for matching strings.