Start with the empty list
struct Node * head = newNode ( 1 ) ; head -> next = newNode ( 2 ) ; head -> next -> next = newNode ( 3 ) ; head -> next -> next -> next = newNode ( 4 ) ; cout << " Given ▁ Linked ▁ List STRNEWLINE " ; printList ( head ) ; head = deleteMid ( head ) ; cout << " Linked ▁ List ▁ after ▁ deletion ▁ of ▁ middle STRNEWLINE " ; printList ( head ) ; return 0 ; }