delete the node in linked list

By -

How will you delete a node when a single pointer to that node is given.

Comments

  1. AnonymousMarch 30, 2011 at 12:25 AM

    copy the contents of the next node to the node which is to be deleted.

    ReplyDelete
  2. AdminMarch 30, 2011 at 10:01 AM

    @above what if it is the last node...

    ReplyDelete
  3. AnkitApril 4, 2011 at 11:34 AM

    These r d thigs i cud come up wid :(
    dont delete the node ..just mark the node as dummy node....
    or implement your Linked list as a xor linked list
    http://en.wikipedia.org/wiki/XOR_linked_list

    ReplyDelete
  4. AdminApril 4, 2011 at 12:34 PM

    @ankit can you please explain what do you mean by marking the node as dummy node...

    ReplyDelete

Post a Comment

Popular posts from this blog

[AMAZON] Vertical sum of nodes

By -
Given a Binary Tree, find vertical sum of the nodes that are in same vertical line. Print all sums through different vertical lines. Examples: 1 / \ 2 3 / \ / \ 4 5 6 7   The tree has 5 vertical lines Vertical-Line-1 has only one node 4 => vertical sum is 4 Vertical-Line-2: has only one node 2=> vertical sum is 2 Vertical-Line-3: has three nodes: 1,5,6 => vertical sum is 1+5+6 = 12 Vertical-Line-4: has only one node 3 => vertical sum is 3 Vertical-Line-5: has only one node 7 => vertical sum is 7 So expected output is 4, 2, 12, 3 and 7
Read more