CareerCup-2.3

Implement an algorithm to delete a node in the middle of a single linked list, given only access to that node 
EXAMPLE
Input: the node ‘c’ from the linked list a->b->c->d->e
Result: nothing is returned, but the new linked list looks like a->b->d->e

#include <iostream>
using namespace std;

// Creating a Linked List:
struct Node
{
    Node(int d):data(d){next = NULL;};
    int data;
    Node* next;
};

void printNode(Node* head)
{
    cout<<"Print:"<<endl;
    while(head != NULL)
    {
        cout<<head->data<<endl;
        head = head->next;
    }
    cout<<"End"<<endl;
};

void deleteMid(Node* p)
{
    if(p == NULL || p->next == NULL) 
        return;
    Node *q = p->next;
    p->data = q->data;
    p->next = q->next;
    delete q;
};

int main()
{
    Node* head = new Node(1);
    head->next = new Node(2);
    head->next->next = new Node(3);
    head->next->next->next = new Node(4);
    head->next->next->next->next = new Node(5);
    head->next->next->next->next->next = new Node(6);
    deleteMid(head->next->next);
    printNode(head);
    system("pause"); 
};