Rating: 5.0

Huffman trees for each compressed chapter of Gadsby contain extra information. In each tree, follow the path from leaf node 'E' to root to get the bit pattern for one byte of the flag.

Original writeup (https://github.com/luker983/google-ctf-2021/tree/main/misc/david-and-the-tree).