See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
14 cards from this deck
Lossless data compression
Shorter
Binary tree
Root node
None - it's lossless
Count character frequencies
Combine two lowest frequency nodes first
Sum of children frequencies
Total character count
0 (right = 1)
Follow path from root to character, writing 0s and 1s
Variable-length
8 bits
Most efficient variable-length encoding possible
Select your subjects, and get access to A+ resources today.