Added Treap class and test for the same

Author: ShreeHarish

src/main/java/com/thealgorithms/datastructures/trees/Treap.java

@@ -66,10 +66,6 @@ public Treap() {
         this.root = null;
     }
 
-    public Treap(int[] nodeValues) {
-        for (int nodeValue : nodeValues) insert(nodeValue);
-    }
-
     /**
      * merges two Treaps left and right into a single Treap
      *

src/test/java/com/thealgorithms/datastructures/trees/TreapTest.java

@@ -6,13 +6,6 @@
 
 public class TreapTest {
 
-    @Test
-    void arrayBuild() {
-        int[] arr = {5, 9, 6, 2, 3, 8, 1};
-        Treap treap = new Treap(arr);
-        assertEquals("{1,2,3,5,6,8,9,}", treap.inOrder());
-    }
-
     @Test
     void build() {
         Treap treap = new Treap();
@@ -25,44 +18,80 @@ void build() {
 
     @Test
     void delete() {
-        int[] arr = {5, 9, 6, 2, 3, 8, 1};
-        Treap treap = new Treap(arr);
+        Treap treap = new Treap();
+        treap.insert(5);
+        treap.insert(9);
+        treap.insert(6);
+        treap.insert(2);
+        treap.insert(3);
+        treap.insert(8);
+        treap.insert(1);
         treap.delete(5);
         assertEquals("{1,2,3,6,8,9,}", treap.inOrder());
     }
 
     @Test
     void searchAndFound() {
-        int[] arr = {5, 9, 6, 2, 3, 8, 1};
-        Treap treap = new Treap(arr);
+        Treap treap = new Treap();
+        treap.insert(5);
+        treap.insert(9);
+        treap.insert(6);
+        treap.insert(2);
+        treap.insert(3);
+        treap.insert(8);
+        treap.insert(1);
         assertEquals(5, treap.search(5).value());
     }
 
     @Test
     void searchAndNotFound() {
-        int[] arr = {5, 9, 6, 2, 3, 8, 1};
-        Treap treap = new Treap(arr);
+        Treap treap = new Treap();
+        treap.insert(5);
+        treap.insert(9);
+        treap.insert(6);
+        treap.insert(2);
+        treap.insert(3);
+        treap.insert(8);
+        treap.insert(1);
         assertEquals(null, treap.search(4));
     }
 
     @Test
     void lowerBound() {
-        int[] arr = {5, 9, 6, 2, 3, 8, 1};
-        Treap treap = new Treap(arr);
+        Treap treap = new Treap();
+        treap.insert(5);
+        treap.insert(9);
+        treap.insert(6);
+        treap.insert(2);
+        treap.insert(3);
+        treap.insert(8);
+        treap.insert(1);
         assertEquals(5, treap.lowerBound(4));
     }
 
     @Test
     void upperBound() {
-        int[] arr = {5, 9, 6, 2, 3, 8, 1};
-        Treap treap = new Treap(arr);
+        Treap treap = new Treap();
+        treap.insert(5);
+        treap.insert(9);
+        treap.insert(6);
+        treap.insert(2);
+        treap.insert(3);
+        treap.insert(8);
+        treap.insert(1);
         assertEquals(6, treap.upperBound(5));
     }
 
     @Test
     void misc() {
-        int[] arr = {5, 9, 6, 2, 3, 8, 1};
-        Treap treap = new Treap(arr);
+        Treap treap = new Treap();
+        treap.insert(5);
+        treap.insert(9);
+        treap.insert(6);
+        treap.insert(2);
+        treap.insert(3);
+        treap.insert(8);
+        treap.insert(1);
         assertEquals(7, treap.size());
         assertEquals(false, treap.isEmpty());
     }