void CartTree::Insert(int v, int p){
    if (CartRoot == NULL){
        CartRoot = new Node(v, p);
        return;
    }
    else {
        Node* currentNode = CartRoot;
        Node* insertable = new Node(v, p);
        while (true){
            if (currentNode->Pri >= insertable->Pri){
                if (currentNode->Data <= insertable->Data){
                    if (currentNode->Right == NULL){
                        currentNode->Right = insertable;
                    }
                    else {
                        currentNode = currentNode->Right;
                    }
                }
                else {
                    if (currentNode->Left == NULL){
                        currentNode->Left = insertable;
                    }
                    else {
                        currentNode = currentNode->Left;
                    }
                }
            }
            else {
                Split(currentNode, insertable->Data, insertable->Left, insertable->Right);
                currentNode = insertable;
            }
        }
    }
}