Question

Data structure :
Can any one explain
Geven a pointer to a linke list node,
explain how we will delete the same node

Answer 1

This depends on if it's a single or double linked list. Which is it?

Answer 2

first explain your question whether you wanted to delete any middle node or...?

Answer 3

you can simply delete it by delete statement

Answer 4

typedef struct nodeSLL
{
int data;
struct nodeSLL *next;
} LIST

singly linked list ^^

typedef struct nodeDLL
{
int data;
struct nodeDLL *prev;
struct nodeDLL *after;
} LIST

doubly^^

as for your delete im not sure if you want at the beginning, specific location, or the end and im to lazy to type all three so once you reply i can help

Answer 5

or if you want SLL or DLL deletion

Answer 6

@Cynosure-EPR @Tyler1992 @03225186213

my question is for SLL
it states that
if you have address of any random node of that linked list and you are said to delelte that node itself...
how it will be done...
as "we will lose the next node address"