Data-Structure-Algorithm/Linked_List.cpp at main · Ritika032/Data-Structure-Algorithm · 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
#include<iostream>
#include<stdlib.h>
using namespace std;
struct node
{
	int data;
	struct node* link;
};
void printlist(struct node* ptr)
{
	while(ptr!=NULL)
	{
		cout<<"Element: "<<ptr->data<<"\n";
		ptr=ptr->link;
	}
}
int main()
{
struct node *n1,*n2,*n3,*n4,*n5;
//Allocate memory for nodes in the linked list in heap.
n1=(struct node*)malloc(sizeof(struct node));
n2=(struct node*)malloc(sizeof(struct node));
n3=(struct node*)malloc(sizeof(struct node));
n4=(struct node*)malloc(sizeof(struct node));
n5=(struct node*)malloc(sizeof(struct node));

n1->data=10;
n1->link=n2;

n2->data=20;
n2->link=n3;

n3->data=30;
n3->link=n4;

n4->data=40;
n4->link=n5;

n5->data=50;
n5->link=NULL;

printlist(n1);
}