«

how to delete last node of a Linked list if you only know the address
of last node.

thanks
sangram

hi
start traversing the node
see if the nodes it points to has the same address as the one you have
if it isnt then goto the next node and continue this process
if u find the address:
1> set the prev node's( where u are right now) next parameter to null
before go to the next node and make a copy..
after that do step no 1 and free the copied node.
sangram wrote:
> how to delete last node of a Linked list if you only know the address
> of last node.
>
> thanks
> sangram

hi friend,

its ok if u know the start of the node.

but only you know the end node and now u delete it.

thanks for comunication.
wrote:
> hi
> start traversing the node
> see if the nodes it points to has the same address as the one you have
> if it isnt then goto the next node and continue this process
> if u find the address:
> 1> set the prev node's( where u are right now) next parameter to null
> before go to the next node and make a copy..
> after that do step no 1 and free the copied node.
> sangram wrote:
> > how to delete last node of a Linked list if you only know the address
> > of last node.
> >
> > thanks
> > sangram

sangram wrote:
> how to delete last node of a Linked list if you only know the address
> of last node.

You can't, because you would need to know the address of the previous
node in order to be able to set its "next" pointer to null. If you
want to be able to remove any arbitrary node without needing to know
the address of any other node, then you will need to implement a
doubly-linked list. That is, each node will have a "next" and
"previous" pointer.

MQ

Try this out.

1. Make sure the address you are having is of Last Node.
2. Update it to Null
3. Free the memory
or step 3 and then step 2 depend on ur algo.

--raxit

sangram wrote:
> how to delete last node of a Linked list if you only know the address
> of last node.
>
> thanks
> sangram

sangram wrote:
> how to delete last node of a Linked list if you only know the address
> of last node.

The answer to your question is to make it a doubly-linked list, then use
code like this:

if(last->prev)
{
last->prev->next = NULL;
last->prev = NULL;
}

If it's a singly-linked list then you're out of luck without access to
either the address of the first node or the address of the node before
the last.

--
Simon.

On 30 Nov 2006 21:53:04 -0800, "sangram" <>
wrote:

>how to delete last node of a Linked list if you only know the address
>of last node.

In the real world:

Tell the interviewer that if he or she ever requires you to do such a
thing, then you don't want to ever work for him or her.

On your way running out the door, ask them what is the return type of
main(). If their response seems suspect--which is highly
probable--keep running, and consider yourself fortunate.

--
jay

sangram wrote:

> how to delete last node of a Linked list if you only know the address
> of last node.

This isn't a C question. comp.programming would be better.

(The answer, from the information given, is "you can't", but if you'd
like to show us the actual C code with the problem, maybe that will
speak more exactly about it.)

--
Chris "subtle, like a barrel" Dollin
"I'm still here and I'm holding the answers" - Karnataka, /Love and Affection/

sangram wrote:
> how to delete last node of a Linked list if you only know the address
> of last node.

If we are talking about a singly-linked list, I don't see how you
expect to do anything with it if you only know the address of the last
node... It's not really a linked list, in my mind, if you haven't got a
start point from which to start traversing...

Is this another homework or interview question? Can we have more
context please?

sangram said:

> how to delete last node of a Linked list if you only know the address
> of last node.

exit(0); will do it. Don't forget <stdlib.h>, though.

--
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/1999
http://www.cpax.org.uk
email: rjh at the above domain, - www.