#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/greedy-algorithms/advanced-greedy/huffman-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/greedy-algorithms/advanced-greedy/huffman-implementation

Repovive

Huffman - Implementation - Advanced Greedy | Greedy Algorithms | Repovive

Repovive.

Greedy Algorithms8 sections · 317 units14h total

Open in Course

Huffman - Implementation

The code

function huffmanCoding(chars, freqs)
 heap := min-heap
 for i from 0 to length of chars - 1
 heap.push(new Node(chars[i], freqs[i]))
 while heap.size() > 1
 left := heap.pop()
 right := heap.pop()
 merged := new Node(null, left.freq + right.freq)
 merged.left := left
 merged.right := right
 heap.push(merged)
 root := heap.pop()
 // Traverse tree to get codes
 generateCodes(root, "")

Time: $O(n \log n)$ . Space: $O(n)$ .