In a linkedlist we have lost the head pointer and currently we are in the
middle(anywhere) of list.
Is it possible to delete the previous node of the current pointer.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on
not possible unless if its a doubly linked list .if i am wrong plz correct
me
On Mon, Aug 8, 2011 at 9:03 PM, Abhishek Gupta
mailatabhishekgu...@gmail.com wrote:
In a linkedlist we have lost the head pointer and currently we are in the
middle(anywhere) of list.
Is it possible to delete the
i doubt it too reply please.
On Mon, Aug 8, 2011 at 8:33 AM, Abhishek Gupta
mailatabhishekgu...@gmail.com wrote:
In a linkedlist we have lost the head pointer and currently we are in the
middle(anywhere) of list.
Is it possible to delete the previous node of the current pointer.
--
You
it's not possible in a singly linked list
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
Is the person a lab instructor?
I had to deal with one who was claiming its an error not include header file
and use its function *in c.*
**I even showed him thats its possible,he said its some hack,how can the
program compile when it doesnt know the definition of the function...:D
Obviously
okay..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/6Diby2oBmy4J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from
actually someone has asked me. he is saying that it is possible and the
funny thing is that he also doesn't know the solution..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
Its a standard question and balaji's approach has been accepted as the best
possible solution.
@Krace: In the list 1-2-3-4-5, If address of 3 is the only known value
if u want to delete 3 from the list, this wont work.
--
You received this message because you are subscribed to the Google
@harish:1-2-3-4-5:if you want to delete 3 and know only 3 's address
without previous one you cannot delete . . .
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe
Now u know 3's address. So copy the content of next node, say 4. Now you
have 1-2-3-4-4-5. Now delete the next node. So now we have
1-2-3-4-5-. Which means 3 has been deleted.
On Wed, Mar 16, 2011 at 6:37 PM, kracekumar ramaraju
kracethekingma...@gmail.com wrote:
.
--
You received this
@harish:Then that can be accepted. . .
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For
1-2-3-4-5
Start from any position ,have two pointers ,let that be a and b.Let a follow
b,so that when b reaches right value ,a will be one node lacking,once b node
is to be deleted,get the address of b node pointing and change the address
of a pointing to the address b pointing to.
1-2-3-4-5
Are you sure that node is not exit in Link list and also memory is free?
On Sun, Mar 13, 2011 at 9:57 AM, abhijith reddy abhijith200...@gmail.comwrote:
copy data from the next node and then delete that next node.
Say you need to delete 3
1 - 2 - 3 - 4 - 5
1 - 2 - 4 - 4 - 5
hi
Given a singly Link list but Head of the List is
unknown so my question is that
How to delete a given node from the List???
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
Copy contents of the next node to current node and delete the next node.
Thanks,
Balaji.
On Sun, Mar 13, 2011 at 10:23 PM, UMESH KUMAR kumar.umesh...@gmail.comwrote:
hi
Given a singly Link list but Head of the List is
unknown so my question is that
How to
copy data from the next node and then delete that next node.
Say you need to delete 3
1 - 2 - 3 - 4 - 5
1 - 2 - 4 - 4 - 5
*
Now delete node which is next to '*'.
On Sun, Mar 13, 2011 at 10:23 PM, UMESH KUMAR kumar.umesh...@gmail.comwrote:
hi
Given a singly Link list but
16 matches
Mail list logo
