Added count feature

linkedlist.c

@@ -0,0 +1,58 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include "linkedlist.h"
+
+
+Node *head = NULL;
+
+
+void insert(int data)
+{
+    Node *newNode = malloc(sizeof(Node));
+
+    newNode->data = data;
+    newNode->next = head;
+
+    head = newNode;
+}
+
+
+void display()
+{
+    Node *temp=head;
+
+    while(temp!=NULL)
+    {
+        printf("%d ",temp->data);
+        temp=temp->next;
+    }
+}
+
+int search(int value)
+{
+    Node *temp = head;
+
+    while(temp != NULL)
+    {
+        if(temp->data == value)
+            return 1;
+
+        temp = temp->next;
+    }
+ return 0;
+}
+
+int count()
+{
+    int count = 0;
+
+    Node *temp = head;
+
+    while(temp != NULL)
+    {
+        count++;
+        temp = temp->next;
+    }
+
+    return count;
+}

linkedlist.h

@@ -0,0 +1,17 @@
+#ifndef LINKEDLIST_H
+#define LINKEDLIST_H
+
+typedef struct Node
+{
+    int data;
+    struct Node *next;
+
+}Node;
+
+
+void insert(int data);
+void display();
+int search(int value);
+int count();
+
+#endif

main.c

@@ -0,0 +1,29 @@
+#include<stdio.h>
+#include "linkedlist.h"
+
+
+int main()
+{
+
+    insert(10);
+    insert(20);
+    insert(30);
+
+    display();
+
+ int result = search(20);
+
+    if(result)
+    {
+        printf("\nElement found");
+    }
+    else
+    {
+        printf("\nElement not found");
+    }
+    printf("\nTotal nodes = %d", count());
+
+
+    return 0;
+ 
+}