Differences

This shows you the differences between two versions of the page.

--- tanszek:oktatas:techcomm:huffman_codes [2024/10/07 07:46] – knehez
+++ tanszek:oktatas:techcomm:huffman_codes [2024/10/07 07:53] (current) – [Steps in Huffman Encoding] knehez
@@ Line 51: / Line 51: @@
 {{:tanszek:oktatas:techcomm:pasted:20241007-074400.png}}
-Merging two nodes:
+Merging two nodes with lowest frequency:
 {{:tanszek:oktatas:techcomm:pasted:20241007-074452.png}}
-Merging two nodes:
+Merging two nodes with lowest frequency
 {{:tanszek:oktatas:techcomm:pasted:20241007-074521.png}}
-Merging two nodes:
+Merging two nodes with lowest frequency
 {{:tanszek:oktatas:techcomm:pasted:20241007-074548.png}}
@@ Line 66: / Line 66: @@
 {{:tanszek:oktatas:techcomm:pasted:20241007-074616.png}}
+=== Step 3: Assign Binary Codes ===
+After building the tree, assign binary codes to each character by traversing the tree. Typically, moving left adds a 0, and moving right adds a 1.
+^Character^Binary Code^
+|A|0|
+|B|100|
+|C|1100|
+|D|1110|
+|E|1111|
+|F|1010|
+|G|1011|
+|H|1101|
+Huffman encoded result:
+<code>BACADAEAFABBAAAGAH -> 100|0|1100|0|1110|0|....|1101</code>