Find and search linked list data
root pointer are pointed to first node of given linked list. we know that about the can be access all other nodes a help of root pointer.the following process to find linked list node data.
1) assign root node value to temp pointer.
because we are not modificated original value of root pointer;
2) using while loop visiting all other linked list node. if temp->data value is equal to find_data. that means find_data are exist. otherwise move next node of linked list. if status variable are 0. and temp->next=NULL that means find data are not exist.
Assume that following data [1,2,3,4,5,6,7] are inserted on linked list.
View insertion process to linked list.
Search linked list node data 
Search data 
Time complexity of this algorithm O(n).
Not given all step of execution process here.View How to insert linked list element, how to print and so on.
c program to find given linked list data exist or not. Iterative approach.
Case 1: Empty Linked list Empty linked List case 2: When linked list are not empty linked list :1 2 3 4 5 6 7 Given data  are exist Given data  are exist Given data  are exist Given data  are note exist Free nodes of linked linked