Data Analysis and algorithms

Huffman Codes are a prefix-based method of text-file compression where no code is a prefix of
another code. Huffman’s algorithm can be used to generate an optimal set of prefix codes,
given the frequency of each symbol’s occurrence
Write a method to read this file, character by character, and count the number of
occurrences of each character. The method should take a file name as input, and should
return an array of Node objects, where a Node contains information about the character
and the number of occurrences. The Node should also have left and right child pointers.
The method should return an array of Nodes