Adaptive Huffman coding is a variation of Huffman coding, which is a popular method of lossless data compression. Unlike standard Huffman coding, where the frequency of symbols is known beforehand and a static code is created before encoding the data, Adaptive Huffman coding builds the Huffman tree dynamically as the data is being encoded or decoded.