Added Treap class and test for the same

Author: ShreeHarish

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

@@ -16,10 +16,10 @@ public class TreapNode {
         /**
          * TreapNode class defines the individual nodes in the Treap
          *
-         * value -> holds the value of the node. 
+         * value -> holds the value of the node.
          * Binary Search Tree is built based on value.
          *
-         * priority -> holds the priority of the node. 
+         * priority -> holds the priority of the node.
          * Heaps are maintained based on priority.
          * It is randomly assigned
          *
@@ -125,7 +125,7 @@ private TreapNode[] split(TreapNode node, int key) {
 
     /**
      * insert a node into the Treap
-     * 
+     *
      * @param value value to be inserted into the Treap
      * @return root of the Treap where the value is inserted
      */
@@ -174,7 +174,7 @@ private TreapNode deleteNode(TreapNode root, int value) {
 
         if (root != null) root.updateSize();
         return root;
-    } 
+    }
 
     /**
      * print inorder traversal of the Treap
@@ -226,7 +226,7 @@ private void printPostOrder(TreapNode root) {
 
     /**
      * Search a value in the Treap
-     * 
+     *
      * @param value value to be searched for
      * @return node containing the value
      * null if not found
@@ -238,11 +238,11 @@ public TreapNode search(int value) {
     private TreapNode searchVal(TreapNode root, int value) {
         if (root == null) return null;
 
-        if (root.value == value) 
+        if (root.value == value)
             return root;
-        else if(root.value < value) 
+        else if(root.value < value)
             return searchVal(root.right, value);
-        else 
+        else
             return searchVal(root.left, value);
     }
 

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

@@ -52,14 +52,14 @@ void lowerBound() {
         assertEquals(5, treap.lowerBound(4));
     }
 
-    @Test 
+    @Test
     void upperBound() {
         int[] arr = {5, 9, 6, 2, 3, 8, 1};
         Treap treap = new Treap(arr);
         assertEquals(6, treap.upperBound(5));
     }
 
-    @Test 
+    @Test
     void misc() {
         int[] arr = {5, 9, 6, 2, 3, 8, 1};
         Treap treap = new Treap(arr);