Delete a Node without head pointer of the Linked List” is a tricky problem asked in many technical interview. Here, We are given a node address of a node to be deleted from the linked list and Our task is to delete that  node. The head of the linked list is not given.

Note: It is assumed that the node to be deleted is not the last node of the linked list.

The steps required to delete the node without head pointer is as follows:

1. As we already know that the node to be deleted is not a last node, we will swap the data value of current node with the data value of next node.
2. And then delete the next node.

C++ Program to delete a node without head pointer is as follows:

```/* C++ Program to Delete a node without head pointer */
#include<bits/stdc++.h>
using namespace std;

/* Structure of the node of the linked list */
struct node
{
int data;
struct node *next;
};

/* Function to insert node at the end of the linked list */
void insert_end(struct node **head, int ele)
{
/* Creating a new node */
struct node *new_node;
new_node = (struct node*)malloc(sizeof(struct node));
new_node->data = ele;
new_node->next = NULL;

/* Check whether the linked list is empty or not */

/* If the linked list is empty, then new node will become head of the linked list */
{
return;
}

/* If the linked list is not empty, then traverse the complete linked list and point the
pointer of the last node of the linked list to the new node*/
struct node *temp = NULL;
while(temp->next != NULL)
temp=temp->next;
temp->next = new_node;
}

/* Function to delete given node of the linked list */
void deleteNode(struct node *Node)
{
/*
As we already know, the node to be deleted is not last node, so
swap the data of given node with the data of next node. Then, delete
the next node of the linked list
*/
int temp = Node -> data;
Node -> data = Node -> next -> data;
Node -> next ->data = temp;
Node -> next = Node -> next -> next;
delete (Node->next);
}

/*
Function to print the linked list
*/
{
while(temp!=NULL)
{
cout<<temp->data<<" ";
temp=temp->next;
}
}
int main()
{
/* Insert Some Nodes in the Linked List */
cout<<"Before deleting 3rd node\n";
cout<<"\nAfter deleting 3rd node\n";
```OUTPUT: