Builds the Huffman tree from a frequency map # Arguments `frequencies` - HashMap of character frequencies # Returns The root node of the Huffman tree, or None if input is empty
(frequencies: HashMap<char, usize>)
Source from the content-addressed store, hash-verified