how to delete all negative nodes from singly liked list?

Question

It is set of positive and negative numbers using linked list we have delete the all negative numbers from that list how i can write code or logic ?

Answer 1

But that is a singly listed list: just look at the struct, it has only one pointer to the next node.

Also, the code does work when you actually build a list. I fixed my post so it compiles for people just copy/pasting, but otherwise, see here for a proper test:
http://www.sololearn.com/app/cplusplus/playground/c3L7mCPF94GB/

Answer 2

I don't have the details of how your linked list is built, but this should be similar:

struct node {
int value;
node* next;
};

int main(void) {
node* root = new node;
root->value = 42;
root->next = 0;
//build your list here

node* prev = 0; //previous node
node* curr = root; //current node
node* tmp; //used for deleting a node
while (curr != 0) {
if (curr->value < 0) {
if (prev != 0) {
prev->next = curr->next;
} else {
root = curr->next;
}
tmp = curr;
curr = curr->next;
delete tmp;
} else {
prev = curr;
curr = curr->next;
}
}

//do whatever you want with your list here

return 0;
}

Answer 3

thank you zen, but I was tried with singly linked list not in doubly linked list. my task is to delete nodes with negative numbers from set of positive and negative numbers using singly linked list. it gives me error at middle of execution that is segmentation fault (core dumped ) not in compiled time error or run time error . help me for to remove that error and also give me logic to do newly.

Answer 4

thank you brother it's working but it is predefined code I want user defined code, Zen can you give me your email id to send my code because it's too big.

Answer 5

c program to delete all nodes from a header linked list that has negative values in its data part.