while( curLvl >= -1){
            if(curLvl != -1){
        while (run->nextJump[curLvl] != Base::_preHead && run->nextJump[curLvl]->key <= key){
                run = run->nextJump[curLvl];
        }
        update[curLvl] = run;
        }
            else {
                // в случае если спустились со всех уровней
                while (run->next != Base::_preHead && run->next->key <= key) {
                    run = run->next;
                }
                newNode->next = run->next;
                run->next = newNode;
            }
            curLvl--;
        }
        for( int i=0; i <= randLevel; i++){
            newNode->nextJump[i] = update[i]->nextJump[i];
            update[i]->nextJump[i] = newNode;
        }