public class Word implements Comparable<Word>{ public String value; public Integer frequency; public Word(String value, Integer frequency){ this.value = value; this.frequency = frequency; } @Override public int compareTo(Word otherWord) { if(this.frequency.equals(otherWord.frequency)) return -1 * this.value.compareTo(otherWord.value); else return this.frequency.compareTo(otherWord.frequency); } public String toString(){ return "[" + value + ", " + frequency + "]"; } }

 public class BinaryHeap { private Word[] wordArray; private int size; public BinaryHeap(Word[] array){ size = array.length; buildHeap(array); } // Problem #2 (20 pts) // Fill in the following method with an O(n) time algorithm // that builds an n element complete binary heap. // Note: You are allowed to add helper methods. // All element comparison must be done by the compareTo method. public void buildHeap(Word[] array){ }

Note: a Word consists a word itself and the frequency. ex) [apple, 25]