Fix treap priorities

Docstring says "more priority", but `<` operator causes lesser
priorities to sort to the top.

Author: Goorzhel

data_structures/binary_tree/treap.py

@@ -65,7 +65,7 @@ def merge(left: Node | None, right: Node | None) -> Node | None:
     """
     if (not left) or (not right):  # If one node is None, return the other
         return left or right
-    elif left.prior < right.prior:
+    elif left.prior > right.prior:
         """
         Left will be root because it has more priority
         Now we need to merge left's right son and right tree