Since the maximum number of characters in the alphabet is fixed and has an upper bound, can't we say that the time complexity is just O(nlog(1)) which simplifies to O(n)? Or at the very least, it would be O(nlog(k)) where k << n since at any given time, the heap can only store a max of k characters.