Think about this stuff: private ArrayList elements = new ArrayList(); private Comparator comparator = (E1, E2) -> (E1.compareTo(E2)); public Heap() { super(); elements.add(null); } public Heap(...

1 answer below »

Think about this stuff:

private ArrayList elements = new ArrayList<>();
private Comparator comparator = (E1, E2) -> (E1.compareTo(E2));
public Heap() {
super();
elements.add(null);
}
public Heap( Comparator comparator) {
super();
this.comparator = comparator ;
elements.add(null);
}

Complete

int percolateUp(int index)

int percolatDown(int index)

That's right two methods.... Just two.

Also pass the unit tests. Run main for fun and all.

heaplabstart-z1euaac2.zip

Answered 2 days After Sep 25, 2022

Solution

Shweta answered on Sep 27 2022

68 Votes

SOLUTION.PDF

Think about this stuff: private ArrayList elements = new ArrayList(); private Comparator comparator = (E1, E2) -> (E1.compareTo(E2)); public Heap() { super(); elements.add(null); } public Heap(...

Solution

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment