Compare commits

..
3 Commits
Author SHA1 Message Date
SF c0a432b2e7 Added count feature 2026-07-29 12:04:10 +00:00
SF 4d9c36b471 Added search feature 2026-07-29 11:55:22 +00:00
SF 9f333aa21c Added basic linked list 2026-07-29 11:35:17 +00:00
4 changed files with 34 additions and 37 deletions
BIN
View File
Binary file not shown.
+21 -20
View File
@@ -1,9 +1,11 @@
#include <stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include<stdlib.h>
#include "linkedlist.h"
Node *head = NULL;
void insert(int data)
{
Node *newNode = malloc(sizeof(Node));
@@ -14,40 +16,39 @@ void insert(int data)
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)
{
printf("%d ", temp->data);
temp = temp->next;
}
}
Node *search(int value)
{
Node *temp = head;
while (temp != NULL)
{
if (temp->data == value)
{
return temp;
}
if(temp->data == value)
return 1;
temp = temp->next;
}
return NULL;
return 0;
}
int count()
{
int count = 0;
Node *temp = head;
while (temp != NULL)
while(temp != NULL)
{
count++;
temp = temp->next;
+3 -3
View File
@@ -1,4 +1,3 @@
#ifndef LINKEDLIST_H
#define LINKEDLIST_H
@@ -7,11 +6,12 @@ typedef struct Node
int data;
struct Node *next;
} Node;
}Node;
void insert(int data);
void display();
Node *search(int value);
int search(int value);
int count();
#endif
+10 -14
View File
@@ -1,33 +1,29 @@
#include <stdio.h>
#include<stdio.h>
#include "linkedlist.h"
int main()
{
insert(10);
insert(20);
insert(30);
printf("Linked List: ");
display();
Node *result = search(20);
if (result != NULL)
int result = search(20);
if(result)
{
printf("\n the Element found: %d\n", result->data);
printf("\nElement found");
}
else
{
printf("\n the Element not found\n");
printf("\nElement not found");
}
printf("Total nodes = %d\n", count());
printf("Count operation completes.\n");
printf("\nThis is Main Branch\n");
printf("\nThis is Feature Branch\n");
printf("\nTotal nodes = %d", count());
return 0;
}