-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathclass-test-2-2.c
87 lines (79 loc) · 2.08 KB
/
class-test-2-2.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
// Create a doubly linked list and insert at the beginning and search for an item
#include <stdio.h>
#include <stdlib.h>
struct node {
int data;
struct node* next;
struct node* prev;
};
void insBeg(struct node** head, int val) {
struct node* newNode = (struct node*)malloc(sizeof(struct node));
newNode->data = val;
newNode->next = *head;
newNode->prev = NULL;
if (*head != NULL) {
(*head)->prev = newNode;
}
*head = newNode;
}
void displayElement(struct node* head) {
struct node* temp = head;
printf("Linked List: ");
while (temp != NULL) {
printf("%d | ", temp->data);
temp = temp->next;
}
printf("\n");
}
void searchElement(struct node** head, int val) {
if (*head == NULL) {
printf("The list is empty.\n");
return;
}
struct node* temp = *head;
int found = 0;
int pos = 1;
while (temp != NULL) {
if (val == temp->data) {
found = 1;
break;
}
temp = temp->next;
pos++;
}
if (found) {
printf("Element %d found at position %d.\n", val, pos);
} else {
printf("Element %d not found.\n", val);
}
}
int main() {
struct node* head = NULL;
int choice, val;
do {
printf("1. Insert at the beginning\n2. Search for an item\n3. Display the list\n4. Exit\n");
printf("Enter your choice: ");
scanf("%d", &choice);
switch (choice) {
case 1:
printf("Enter data to insert at the beginning: ");
scanf("%d", &val);
insBeg(&head, val);
break;
case 2:
printf("Enter the item to search: ");
scanf("%d", &val);
searchElement(&head, val);
break;
case 3:
displayElement(head);
break;
case 4:
printf("Exiting...\n");
break;
default:
printf("Invalid choice. Try again.\n");
}
} while (choice != 4);
return 0;
}