dslk.cpp

Node* addNode(Node* head, int index, int value){
    Node *addElement = new Node;
    Node *pre = new Node;
    Node *cur = new Node;
    addElement->value = value;
    addElement->nextNode = NULL;
    if(head == NULL)  head = addElement;
    else {
    cur = head;
    for(int i = 0; i <= index; ++i) {
        pre = cur;
        cur = cur->nextNode;
    }
    pre->nextNode = addElement;
    addElement->nextNode = cur;
    }
    return head;  
}
 
Node* deleteNode(Node* head, int index){
    Node *pre = new Node;
    Node *cur = new Node;
    cur = head;
    if(head == NULL) return head;
    else {
       for(int i = 0; i < index; ++i) {
        pre = cur;
        cur = cur->nextNode;
    }
    pre->nextNode = cur->nextNode;
    return head;  
    }
}