Revision as of 16:03, 9 November 2018 edit 2001:6a0:5001:b:edb5:7a41:ac26:e1f2 (talk) →Vitter algorithm ← Previous edit		Revision as of 23:05, 17 November 2018 edit undo 188.35.7.144 (talk) →corrected inconsistent naming Next edit →
Line 37: p = pointer to the leaf node containing the next symbol IF (p is NYT) THEN Extend Pp by adding two children Left child becomes new NYT and right child is the new symbol leaf node p = parent of new symbol leaf node

Adaptive Huffman coding: Difference between revisions