forked from a-r-nida/HactoberFest2020-Beginers
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSearch_LL.c
64 lines (59 loc) · 957 Bytes
/
Search_LL.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
//Display a Linked List
#include <stdio.h>
#include <stdlib.h>
struct Node
{
int data;
struct Node *next;
}*first=NULL;
void create(int A[],int n)
{
int i;
struct Node *t,*last;
first=(struct Node *)malloc(sizeof(struct Node));
first->data=A[0];
first->next=NULL;
last=first;
for(i=1;i<n;i++)
{
t=(struct Node*)malloc(sizeof(struct Node));
t->data=A[i];
t->next=NULL;
last->next=t;
last=t;
}
}
struct Node * LSearch(struct Node *p,int key)
{
struct Node *q;
while(p!=NULL)
{
if(key==p->data)
{
q->next=p->next;
p->next=first;
first=p;
return p;
}
q=p;
p=p->next;
}
return NULL;
}
struct Node * RSearch(struct Node *p,int key)
{
if(p==NULL)
return NULL;
if(key==p->data)
return p;
return RSearch(p->next,key);
}
int main()
{
struct Node *temp;
int A[]={3,5,7,10,25,8,32,2};
create(A,8);
temp=Search(first,8);
printf(“%d”,temp->data);
return 0;
}