Huffman coding: Difference between revisions

var trees treeHeap

for c, f := range charFreqs {

}

heap.Init(&trees)

 

// put into new node and re-insert into queue

}

return heap.Pop(&trees).(HuffmanTree)

func printCodes(tree HuffmanTree, prefix []int) {

switch i := tree.(type) {

// print out character, frequency, and code for this leaf (which is just the prefix)

fmt.Printf("%c\t%d\t%s\n", i.value, i.freq, string(prefix))

// traverse left

prefix = append(prefix, '0')