forked from abhimanyuiscoding/Hacktoberfest2022
-
Notifications
You must be signed in to change notification settings - Fork 0
/
findnodeinLinkedList.cpp
66 lines (60 loc) · 1014 Bytes
/
findnodeinLinkedList.cpp
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
#include <iostream>
class Node
{
public:
int data;
Node *next;
Node(int data)
{
this->data = data;
this->next = NULL;
}
};
using namespace std;
Node *takeinput()
{
int data;
cin >> data;
Node *head = NULL, *tail = NULL;
while (data != -1)
{
Node *newNode = new Node(data);
if (head == NULL)
{
head = newNode;
tail = newNode;
}
else
{
tail->next = newNode;
tail = newNode;
}
cin >> data;
}
return head;
}
int findNodeRec(Node *head, int n)
{
int index = 0;
Node * temp = head;
while(temp!=NULL){
if(temp->n == n){
return index;
}
temp = temp->next;
index++;
}
return -1;
}
int main()
{
int t;
cin >> t;
while (t--)
{
Node *head = takeinput();
int val;
cin >> val;
cout << findNodeRec(head, val) << endl;
}
}