added a few more things to test with, improved counting, implemented sorting.

It now counts ascii characters in constant time. anything else it does in logarithmic ish time (rebalancing is not yet implemented)
It now combines the arrays from ascii and non ascii counts into a single array with no nulls, then sorts it, and outputs to a linked list.
that means it is ready to sort into a proper huffman tree.