Re: deletion in singly linked list

[Jagadeesh Bhaskar P <jbhaskar@hclinsys.com>]

Thanks for the reply. Adding my comments below:

On Thu, 2004-11-25 at 15:41, Alphex Kaanoken wrote:
> if you need to remove member in any place you must do following things
>  - find member to remove
>  - take a pointer of prev member and change him to the next member that following after removeing member
>  - free memory that malloced for removing member
But I had explained previously, that this is a special case. I dont know
which is the head and which is the tail of a singly linkedlist. All I
know is that this is a node of the linked list and say the format of the
node. So from this I can get only the pointer to its next node. How can
I find its previous node? Is there a way to find it out?

Otherwise its simply linkedlist manipluation, and thatz not what I asked
for :-(

-- 
With regards,

Jagadeesh Bhaskar P
R&D Engineer
HCL Infosystems Ltd
Pondicherry
INDIA