Author: Stan Eisenstat
Subject: Re: [Cs323] huffman
Date: Monday, 05 Oct 2020, 06:37:22

    > Message Posted By: Unknown
    >
    > In the notes, it says dynamic updating of codes (using dyanmic tree) can
    > be done without recomputing the tree from scracth. But lets say that two
    > characters chnage in relative frequency (freq(b) > freq(a) became freq(a)
    > > freq(b) later on), then wouldn't the tree have to be recomputed?

Yes, but not from scratch.  See

  https://en.wikipedia.org/wiki/Adaptive_Huffman_coding

for more details.

--Stan-