private HuffmanNode buildTree() {

        PriorityQueue<HuffmanNode> pq = new PriorityQueue<>();

        for(char i = 0; i < encodeTable.size(); i++) {
            pq.add(new HuffmanNode(i));
        }

        while(pq.size() > 1) {
            HuffmanNode zero = pq.poll();
            HuffmanNode one = pq.poll();
            HuffmanNode parent = new HuffmanNode(zero.count + one.count);
            pq.add(parent);
          //  System.out.println(pq);

        }
        return pq.poll();
            }