Huffman Encoding in DSA Typescript - Execution Trace

Concept Flow - Huffman Encoding

Count frequency of each character

↓

Create leaf nodes for each char

↓

Build min-heap from leaf nodes

↓

While heap size > 1

↓

Extract two smallest nodes

↓

Create new internal node with these two as children

↓

Insert new node back into heap

Back to While↓

Heap has one node: root of Huffman Tree

↓

Traverse tree to assign codes

↓

Output codes for each character

↩Back to While

This flow shows how Huffman Encoding builds a tree from character frequencies, then assigns binary codes by traversing the tree.

Execution Sample

DSA Typescript

const freq = {a:5, b:9, c:12, d:13, e:16, f:45};
// Build Huffman Tree and assign codes
// Output codes for each character

This code builds a Huffman tree from given character frequencies and outputs the binary codes.

Execution Table

Step	Heap Content (nodes with freq)	Action	New Node Created	Heap After Insertion
1	[a:5, b:9, c:12, d:13, e:16, f:45]	Extract two smallest: a:5, b:9	Node(ab):14	[Node(ab):14, c:12, d:13, e:16, f:45]
2	[Node(ab):14, c:12, d:13, e:16, f:45]	Extract two smallest: c:12, d:13	Node(cd):25	[Node(ab):14, Node(cd):25, e:16, f:45]
3	[Node(ab):14, Node(cd):25, e:16, f:45]	Extract two smallest: Node(ab):14, e:16	Node(abe):30	[Node(cd):25, Node(abe):30, f:45]
4	[Node(cd):25, Node(abe):30, f:45]	Extract two smallest: Node(cd):25, Node(abe):30	Node(cdabe):55	[f:45, Node(cdabe):55]
5	[f:45, Node(cdabe):55]	Extract two smallest: f:45, Node(cdabe):55	Node(root):100	[Node(root):100]
6	[Node(root):100]	Only one node left, stop	-	[Node(root):100]

💡 Heap size is 1, Huffman tree is complete with root node frequency 100

Variable Tracker

Variable	Start	After Step 1	After Step 2	After Step 3	After Step 4	After Step 5	Final
Heap	[a:5, b:9, c:12, d:13, e:16, f:45]	[Node(ab):14, c:12, d:13, e:16, f:45]	[Node(ab):14, Node(cd):25, e:16, f:45]	[Node(cd):25, Node(abe):30, f:45]	[f:45, Node(cdabe):55]	[Node(root):100]	[Node(root):100]
New Node	-	Node(ab):14	Node(cd):25	Node(abe):30	Node(cdabe):55	Node(root):100	-

Key Moments - 3 Insights

Why do we always pick the two smallest frequency nodes from the heap?

Picking the two smallest nodes ensures the tree has minimal weighted path length, which leads to optimal prefix codes. See execution_table steps 1-5 where smallest nodes are combined each time.

What happens when the heap size becomes 1?

When heap size is 1, it means the Huffman tree is fully built with a single root node. This is shown in execution_table step 6 where the process stops.

Why do we insert the new combined node back into the heap?

Inserting the new node back keeps the heap updated with combined frequencies so the next smallest pairs can be extracted. This is shown in execution_table after each new node creation.

Visual Quiz - 3 Questions

Look at the execution_table at Step 3, what nodes are extracted from the heap?

A Node(ab):14 and e:16

B c:12 and d:13

C a:5 and b:9

D f:45 and Node(cdab e):55

💡 Hint

Check the 'Action' column at Step 3 in execution_table

At which step does the heap size become 1, ending the tree building?

A Step 4

B Step 5

C Step 6

D Step 3

💡 Hint

Look at the 'Exit Note' and Step 6 in execution_table

If the frequency of 'f' was smaller than 'e', how would the heap content change after Step 4?

A Node(abe):30 would be replaced by Node(abf)

B Node(cd):25 would be replaced by Node(cf)

C Node(cdab e):55 would have a smaller frequency

D Heap would contain f:45 and Node(cdab e):55 as before

💡 Hint

Consider how combining smallest nodes changes new node frequencies in variable_tracker

Concept Snapshot

Huffman Encoding builds a binary tree from character frequencies.
Use a min-heap to repeatedly combine two smallest nodes.
Each combined node frequency is sum of children.
Stop when one node remains: the root.
Traverse tree to assign binary codes (left=0, right=1).
Codes are prefix-free and optimal for compression.

Full Transcript

Huffman Encoding starts by counting how often each character appears. Then, it creates leaf nodes for each character with their frequencies. These nodes go into a min-heap. We repeatedly take out the two smallest nodes, combine them into a new node with frequency equal to their sum, and put this new node back into the heap. This continues until only one node remains, which is the root of the Huffman tree. Finally, we traverse the tree to assign binary codes to each character, where going left adds '0' and right adds '1'. This method produces the shortest possible codes for the characters based on their frequencies.