FilesExpand file tree

 main

/

singly_linked_list.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

398 lines (371 loc) · 8.43 KB

 main

/

singly_linked_list.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

398 lines (371 loc) · 8.43 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

397

398

/*-------------------- In The Name Of Allah --------------------------------

-------------------- Performer : Md Mossadek Touhid -----------------------*/

#include <bits/stdc++.h>

using namespace std;

///-------------------------------Chapter 5----------------------------------///

///-------------------------------Linked Lists-------------------------------///

///----------------------Singly Linked List/One Way Linked List--------------///

/*

class node

{

public:

int info;

node *link;

};

node *Head=NULL,*temp;

void creation(int data)

{

node *ptr;

ptr=new node();

ptr->info=data;

ptr->link=NULL;

if(Head==NULL)

{

Head=ptr;

temp=ptr;

}

else

{

temp->link=ptr;

temp=ptr;

}

}

void traversal()

{

node *srt;

for(srt=Head;;)

{

if(srt->link!=NULL)

{

cout<<srt->info<<" ";

srt=srt->link;

}

else

{

cout<<srt->info<<endl;

break;

}

}

cout<<endl;

}

void search()

{

int s_item;

cout<<"The searching item(node) is: ";

cin>>s_item;

node *srt;

for(srt=Head;;)

{

if(s_item==srt->info)

{

cout<<"Item(node) is found"<<endl;

break;

}

else

{

srt=srt->link;

}

if(srt==NULL)

{

cout<<"Item(node) is not found"<<endl;

break;

}

}

cout<<endl;

}

void insert_first()

{

int data;

cout<<"Enter a data(node) that will be inserted at first: ";

cin>>data;

node *ptr;

ptr=new node();

ptr->info=data;

ptr->link=Head;

Head=ptr;

traversal();

}

void insert_last()

{

int data;

cout<<"Enter a data(node) that will be inserted at last: ";

cin>>data;

node *ptr;

ptr=new node();

ptr->info=data;

ptr->link=NULL;

node *srt;

for(srt=Head;;)

{

if(srt->link==NULL)

{

srt->link=ptr;

break;

}

else

{

srt=srt->link;

}

}

traversal();

}

void insert_before_a_given_node()

{

int s_item;

cout<<"Enter search item(node) which before, a data(node) is inserted: ";

cin>>s_item;

node *srt,*temp;

for(srt=Head;;)

{

if(s_item==srt->info)

{

if(srt==Head)

{

insert_first();

break;

}

else

{

int data;

cout<<"Enter a data(node) that will be inserted before given node: ";

cin>>data;

node *ptr;

ptr=new node();

ptr->info=data;

ptr->link=srt; ///ptr->link=temp->link;

temp->link=ptr;

traversal();

break;

}

}

else

{

temp=srt;

srt=srt->link;

}

if(srt==NULL)

{

cout<<"The given node is not found."<<endl;

}

}

}

void insert_after_a_given_node()

{

int s_item;

cout<<"Enter search item(node) which after, a data(node) is inserted: ";

cin>>s_item;

node *srt;

for(srt=Head;;)

{

if(s_item==srt->info)

{

if(srt->link==NULL)

{

insert_last();

break;

}

else

{

int data;

cout<<"Enter a data(node) that will be inserted after given node: ";

cin>>data;

node *ptr;

ptr=new node();

ptr->info=data;

ptr->link=srt->link;

srt->link=ptr;

traversal();

break;

}

}

else

{

srt=srt->link;

}

if(srt==NULL)

{

cout<<"The given node is not found."<<endl;

}

}

}

//void delete_first() ///Another first deletion code is given just after this.

//{

// node *srt;

// for(srt=Head;;)

// {

// srt=srt->link;

// Head=srt;

// break;

// }

// cout<<"Linked List after first delete:"<<endl;

// traversal();

//}

void delete_first() ///It also works.But I could not understand it.

{

node *srt=Head;

Head=srt->link;

cout<<"Linked List after first delete:"<<endl;

traversal();

}

void delete_last()

{

node *srt,*temp=NULL;

for(srt=Head;;)

{

temp=srt; ///These two statements are written in else portion.

srt=srt->link;

if(srt->link==NULL)

{

temp->link=NULL;

break;

} ///else{temp=srt;srt=srt->link;}

}

cout<<"Linked List after last delete:"<<endl;

traversal();

}

void delete_given_node()

{

int s_item;

cout<<"Enter a data(node) that will be deleted: ";

cin>>s_item;

node *srt,*temp=NULL;

for(srt=Head;;)

{

if(s_item==srt->info)

{

if(srt==Head)

{

delete_first();

break;

}

else if(srt->link==NULL)

{

delete_last();

break;

}

else

{

temp->link=srt->link;

cout<<"Linked List after deleting given node:"<<endl;

traversal();

break;

}

}

else

{

temp=srt;

srt=srt->link;

}

if(srt==NULL)

{

cout<<"The given node is not found."<<endl;

break;

}

}

}

void delete_before_a_given_node()

{

int s_item;

cout<<"Enter a data(node) which before,a data(node) will be deleted: ";

cin>>s_item;

node *srt,*temp=NULL,*prev=NULL;

for(srt=Head;;)

{

if(s_item==srt->info)

{

if(srt==Head)

{

cout<<"No item before this.So,Not possible."<<endl;

break;

}

else if(temp==Head)

{

delete_first();

break;

}

else

{

prev->link=temp->link; ///prev->link=srt;

cout<<"Linked List after deleting before a given node:"<<endl;

traversal();

break;

}

}

else

{

prev=temp;

temp=srt;

srt=srt->link;

}

if(srt==NULL)

{

cout<<"The given node is not found."<<endl;

break;

}

}

}

void delete_after_a_given_node()

{

int s_item;

cout<<"Enter a data(node) which after,a data(node) will be deleted: ";

cin>>s_item;

node *srt,*temp;

for(srt=Head;;)

{ ///Here, we can write temp=srt->link;then, else{srt=srt->link;}

if(s_item==srt->info)

{

if(temp==NULL)

{

cout<<"No item after this.So,Not possible."<<endl;

break;

}

else if(temp->link==NULL)

{

delete_last();

break;

}

else

{

srt->link=temp->link;

cout<<"Linked List after deleting after a given node:"<<endl;

traversal();

break;

}

}

else /// Above comment line is for this else{} condition.

{

srt=temp;

temp=srt->link;

}

if(srt==NULL)

{

cout<<"The given node is not found."<<endl;

break;

}

}

}

int main()

{

int n,item,i;

cout<<"Enter list size: ";

cin>>n;

for(i=0; i<n; i++)

{

cin>>item;

creation(item);

}

cout<<endl;

traversal();

search();

insert_first();

insert_last();

insert_before_a_given_node();

insert_after_a_given_node();

delete_first();

delete_last();

delete_given_node();

delete_before_a_given_node();

delete_after_a_given_node();

return 0;

}

*/