[Linked List] Remove Linked List Elements

Total accepted:43183 Total submissions:160460 difficulty:easy

Remove all elements from a linked list of integers, that has value val.

Example
Given: 1---2--and 6---3---4---5, val = 6
Return: 1--2--and 3--4--5

(e) Remove Element (e) Delete Node in a Linked List

/** Definition for singly-linked list. * struct ListNode {* int val; * ListNode *next; * ListNode (int x) : Val (x), Next (NULL) {}}; */classSolution { Public: ListNode* Removeelements (listnode* head,intval) {ListNode* p = head,*next=null,*pre=NULL;  while(P && p->val==val) {Next= p->Next; Delete(P); P=Next; Head=p; }         while(p) {if(P->val = =val) {Pre->next = p->Next; Delete(P); P= pre->Next; }Else{Pre=p; P=p->Next; }        }        returnHead; }};

Next challenges: (M) Convert Sorted list to Binary Search Tree (H) Copy List with Random Pointer (E) intersection of L Inked Lists

[Linked List] Remove Linked List Elements