Data-structures/Linklist-basics.cpp at master · bilalkhann16/Data-structures · GitHub

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
#include<iostream>
using namespace std;

struct node{
	int value;
	node *nextnode;
};

node *create_node(node *current,int new_value)
{
	node *n;
	n=new node;
	n->value=new_value;
	n->nextnode=NULL;

	current->nextnode=n;
	return n;
}
void outputlist(node *current)
{
	cout<<"[";
	while(current!=NULL)
	{cout<<current->value<<" ";
	current=current->nextnode;}
	cout<<"]";

}

void search(node *current)
{
	int no,flag=0;
	cout<<"Enter the no:";
	cin>>no;

	while (current->nextnode!=NULL)
	{
		current=current->nextnode;
		if (current->value==no){
		cout<<"found";
		flag=1;}

	}
	if (flag==0)
		cout<<"not found";


}
int main()
{
	node *head;
	head=new node;
	head->value=10;
	head->nextnode=NULL;

	node *current=head;
	current=create_node(current,11);
	current=create_node(current,12);
	current=create_node(current,13);
	current=create_node(current,14);

	current=head;
	outputlist(current);

	current=head;
	search(current);


}