Node* Insert(Node* root, Node* newNode) {
        if (root->priority < newNode->priority) {
            auto temp = split(root, newNode->value);
            newNode->left = temp.first;
            newNode->right = temp.second;
            Relax(newNode);
            return newNode;
        }
        if (root->value >= newNode->value) {
           root->left = Insert(root->left, newNode->value);
            Relax(root);
            return root;
        } else {
            root->right = Insert(root->right, newNode->value);
            Relax(root);
            return root;
        }
    }