BAEL-4409 : codes have been added (#10925)

* BAEL-4409 : codes have been added

* BAEL-4409 : how to implement min-max heap in java

* BAEL-4409 : how to implement min-max heap in java
This commit is contained in:
Arash Ariani
2021-06-20 18:21:00 +04:30
committed by GitHub
parent 51ceab1ac3
commit dd715d4e70
2 changed files with 376 additions and 0 deletions
@@ -0,0 +1,32 @@
package com.baeldung.minmaxheap;
import org.junit.Assert;
import org.junit.Test;
import java.util.Arrays;
import java.util.List;
public class MinMaxHeapUnitTest {
@Test
public void givenUnOrderedArray_WhenCreateMinMaxHeap_ThenIsEqualWithMinMaxHeapOrdered() {
List<Integer> list = Arrays.asList(34, 12, 28, 9, 30, 19, 1, 40);
MinMaxHeap<Integer> minMaxHeap = new MinMaxHeap<>(list);
minMaxHeap.create();
Assert.assertEquals(Arrays.asList(1, 40, 34, 9, 30, 19, 28, 12), list);
}
@Test
public void givenNewElement_WhenInserted_ThenIsEqualWithMinMaxHeapOrdered() {
MinMaxHeap<Integer> minMaxHeap = new MinMaxHeap(8);
minMaxHeap.insert(34);
minMaxHeap.insert(12);
minMaxHeap.insert(28);
minMaxHeap.insert(9);
minMaxHeap.insert(30);
minMaxHeap.insert(19);
minMaxHeap.insert(1);
minMaxHeap.insert(40);
Assert.assertEquals(Arrays.asList(1, 40, 28, 12, 30, 19, 9, 34), minMaxHeap.getMinMaxHeap());
}
}