-
Notifications
You must be signed in to change notification settings - Fork 0
/
Lesson11.cpp
166 lines (139 loc) · 2.59 KB
/
Lesson11.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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
typedef struct Node
{
int data;
Node* next;
};
Node* insertn(Node* head,int d,int pos)
{
Node *temp=new Node();
temp->data=d;
temp->next=NULL;
if(pos==1)
{
temp->next=head;
head=temp;
}
else
{
Node* temp2=head;
for(int i=0; i<pos-2; i++)
{
temp2=temp2->next;
}
temp->next=temp2->next;
temp2->next=temp;
}
return head;
}
void print(Node* head)
{
Node *temp=head;
while(temp!=NULL)
{
cout<<temp->data<<" ";
temp=temp->next;
}
cout<<endl;
}
Node* deleten(Node* head, int no, int pos)
{
Node* temp1=head;
if(pos==1)
{
head=temp1->next;
}
else
{
Node* before;
for(int i=1; i<pos; i++)
{
before=temp1;
temp1=temp1->next;
}
before->next=temp1->next;
}
return head;
}
Node* reversell(Node* cur , Node*prev , Node*next)
{
if(cur==NULL)
{
cur=prev;
return cur;
}
next=cur->next;
cur->next=prev;
prev=cur;
cur=next;
reversell(cur,prev,next);
}
void forwardp(Node* head)
{
if(head==NULL)
{
cout<<endl;
return;
}
cout<<head->data<<" ";
forwardp(head->next);
}
void backwardp(Node* head)
{
if(head==NULL)
{
return;
}
backwardp(head->next);
cout<<head->data<<" ";
}
int main()
{
Node *head;
int no;
int pos;
int option;
head =NULL;
while(1)
{
cout<<"1. insert at nth position"<<endl<<"2.print"<<endl<<"3.delete node"<<endl<<"4.reverse ll"<<endl<<"5.recursive forward print"<<endl<<"5.recursive backward print"<<endl;
cout<<"select an option"<<endl;
cin>>option;
if(option==1)
{
cout<<"Enter data"<<endl;
cin>>no;
cout<<"enter position"<<endl;
cin>>pos;
head=insertn(head,no,pos);
}
else if(option==2)
{
print(head);
}
else if(option==3)
{
cout<<"enter position"<<endl;
cin>>pos;
head=deleten(head,no,pos);
}
else if(option==4)
{
Node *cur=head;
Node* prev=NULL;
Node*next=NULL;
head=reversell(cur,prev,next);
}
else if(option==5)
{
forwardp(head);
}
else if(option==6)
{
backwardp(head);
cout<<endl;
}
}
}