modified search feature

linkedlist.c

@@ -25,7 +25,7 @@ void display()
     }
 }
 
-int search(int value)
+Node *search(int value)
 {
     Node *temp = head;
 
@@ -33,13 +33,13 @@ int search(int value)
     {
         if (temp->data == value)
         {
-            return 1;   
+            return temp;
         }
 
         temp = temp->next;
     }
 
-    return 0;   
+    return NULL;
 }
 
 int count()

linkedlist.h

@@ -11,7 +11,7 @@ typedef struct Node
 
 void insert(int data);
 void display();
-int search(int value); 
+Node *search(int value);
 int count();
 
 #endif

main.c

@@ -6,17 +6,20 @@ int main()
     insert(10);
     insert(20);
     insert(30);
+  printf("Linked List: ");
 
     display();
 
-if (search(20))
+Node *result = search(20);
+ if (result != NULL)
     {
-        printf("\nElement found\n");
+        printf("\nElement found: %d\n", result->data);
     }
     else
     {
         printf("\nElement not found\n");
     }
+
     printf("Total nodes = %d\n", count());
 
     return 0;