Adaptive Huffman coding: Difference between revisions

Revision as of 06:04, 16 June 2019

Revision as of 06:07, 16 June 2019

Line 29:

[[File:Leaf step four.png|thumb|Slide_And_Increment(leaf node) sliding step 4. Method comes to an end. P is the new parent.]]

[[File:Internal one.png|thumb|Slide_And_Increment(internal node) sliding starts. P is an internal node.]]

[[File:Internal two.png|thumb|Slide_And_Increment(internal node) sliding step 2. Node P slides in front of next block of leafleaves nodes, with weight wt+1.]]

[[File:Internal three.png|thumb|Slide_And_Increment(internal node) sliding step 3. Now we increase the weight byto 19. Thus the '''''invariant is maintained''''' as the current node is an internal node and should occur in front of leaf nodes of equal weight as we have increased the weight. ]]

[[File:Internal four.png|thumb|Slide_And_Increment(internal node) sliding step 4. Now the 'P' points to the former parent ( as in the case of internal node according to algorithm)]]