In this topic, you will learn about, C Program To Demo Single Link List Operations Version 1.
|
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 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 |
/* --------------------------------------------------------- */ /* Program To Demo. Single Link List Operations. Version - I */ /* --------------------------------------------------------- */ //---Including Required Header Files. #include<alloc.h> #include<ctype.h> #include<conio.h> #include<stdio.h> #include<stdlib.h> //--- Declaring Struccture Of Link List Node. struct LinkList { int info; struct LinkList *NEXT; }; //--- Declaring Head Of The List & Assigning NULL To It. struct LinkList **HEAD = NULL; //--- Method To Display Message With Specified Argument. void Pause(char *msg) { printf("\n\n%s", msg); printf("\nPress Any Key To Continue..."); fflush(stdin); getch(); } //--- Insert Node At Begin. void AddBegin(void) { int x; clrscr(); printf("\nINSERT NODE AT BEGIN:"); printf("\n~~~~~~~~~~~~~~~~~~~~~"); printf("\nEnter Info. For New Node: "); scanf("%d", &x); LinkList *newNode = (LinkList *) malloc(sizeof(LinkList)); newNode->info = x; newNode->NEXT = *HEAD; *HEAD = newNode; } //--- Insert Node At End. void AddEnd(void) { int x; clrscr(); printf("\nINSERT NODE AT END:"); printf("\n~~~~~~~~~~~~~~~~~~~"); printf("\nEnter Info. For New Node: "); scanf("%d", &x); LinkList *newNode = (LinkList *) malloc(sizeof(LinkList)); newNode->info = x; if(*HEAD == NULL) { newNode->NEXT = *HEAD; *HEAD = newNode; } else { LinkList *curNode = *HEAD; while(curNode->NEXT != NULL) curNode = curNode->NEXT; newNode->NEXT = curNode->NEXT; curNode->NEXT = newNode; } } //--- Insert Node After Any Specified Node. void AddAfter(void) { int x, src, flag = 0; clrscr(); printf("\nINSERT NODE AFTER ANY NODE:"); printf("\n~~~~~~~~~~~~~~~~~~~~~~~~~~~"); if(*HEAD == NULL) { Pause("List Is Empty, Hence Can\'t Perform This Operation. Try Later."); return; } printf("\nEnter Info. For Node After Which New Node To Be Inserted: "); scanf("%d", &src); LinkList *curNode = *HEAD; while(curNode != NULL) { if(curNode->info == src) { flag = 1; break; } curNode = curNode->NEXT; } if(flag == 1) { printf("\nEnter Info. For New Node: "); scanf("%d", &x); LinkList *newNode = (LinkList *) malloc(sizeof(LinkList)); newNode->info = x; newNode->NEXT = curNode->NEXT; curNode->NEXT = newNode; } else Pause("Given Info. Does Not Exist, Try Again."); } //--- Traversal Of Link List. void ViewAll(void) { clrscr(); printf("\nTRAVERSAL OF LINK LIST:"); printf("\n~~~~~~~~~~~~~~~~~~~~~~"); LinkList *Node = *HEAD; printf("\nHEAD = %6u", *HEAD); printf("\n/--------------------------\\"); printf("\n| Addr | Info | NEXT |"); printf("\n|--------|--------|--------|"); while(Node != NULL) { printf("\n| %-6u | %6d | %-6u |", Node, Node->info, Node->NEXT); Node = Node->NEXT; } printf("\n\\--------------------------/"); Pause(""); } //--- Searching An Node (Ver-1). void Search1(void) { int src, flag = 0; clrscr(); printf("\nSEARCH ANY NODE:"); printf("\n~~~~~~~~~~~~~~~~"); if(*HEAD == NULL) { Pause("List Is Empty, Hence Can\'t Perform This Operation. Try Later."); return; } printf("\nEnter Info. To Search Node: "); scanf("%d", &src); LinkList *curNode = *HEAD; while(curNode != NULL) { if(curNode->info == src) { flag = 1; break; } curNode = curNode->NEXT; } if(flag == 1) { printf("\nHEAD = %6u", *HEAD); printf("\n/--------------------------\\"); printf("\n| Addr | Info | NEXT |"); printf("\n|--------|--------|--------|"); printf("\n| %-6u | %6d | %-6u |", curNode, curNode->info, curNode->NEXT); printf("\n\\--------------------------/"); Pause(""); } else Pause("Given Info. Does Not Exist, Try Again."); } //--- Searching An Node (Ver-2). LinkList * Search2(int src) { LinkList *curNode = *HEAD; while(curNode != NULL) { if(curNode->info == src) break; curNode = curNode->NEXT; } return curNode; } //--- Edit Begin Node Info. void EditBegin(void) { int x; clrscr(); printf("\nEDIT BEGIN NODE INFO:"); printf("\n~~~~~~~~~~~~~~~~~~~~~"); if(*HEAD == NULL) { Pause("List Is Empty, Try Later."); return; } LinkList *curNode = *HEAD; printf("\nHEAD = %6u", *HEAD); printf("\n/--------------------------\\"); printf("\n| Addr | Info | NEXT |"); printf("\n|--------|--------|--------|"); printf("\n| %-6u | %6d | %-6u |", curNode, curNode->info, curNode->NEXT); printf("\n\\--------------------------/"); printf("\nEnter New Info. For Begin Node: "); scanf("%d", &x); curNode->info = x; Pause("Info. Changed Successfully."); } //--- Edit End Node Info. void EditEnd(void) { int x; clrscr(); printf("\nEDIT END NODE INFO:"); printf("\n~~~~~~~~~~~~~~~~~~~"); if(*HEAD == NULL) { Pause("List Is Empty, Try Later."); return; } LinkList *curNode = *HEAD; while(curNode->NEXT != NULL) curNode = curNode->NEXT; printf("\nHEAD = %6u", *HEAD); printf("\n/--------------------------\\"); printf("\n| Addr | Info | NEXT |"); printf("\n|--------|--------|--------|"); printf("\n| %-6u | %6d | %-6u |", curNode, curNode->info, curNode->NEXT); printf("\n\\--------------------------/"); printf("\nEnter New Info. For End Node: "); scanf("%d", &x); curNode->info = x; Pause("Info. Changed Successfully."); } //--- Edit After Node Info. void EditAfter(void) { int src, x; clrscr(); printf("\nEDIT AFTER NODE INFO:"); printf("\n~~~~~~~~~~~~~~~~~~~~~"); if(*HEAD == NULL) { Pause("List Is Empty, Try Later."); return; } printf("\nAfter Which Node Info. You Like To Change: "); scanf("%d", &src); LinkList *curNode = Search2(src); if(curNode == NULL) { Pause("Given Node Does Not Exist, Try Later."); return; } if(curNode->NEXT == NULL) { Pause("Their Is No Node After Specified Node, Try Later."); return; } printf("\nHEAD = %6u", *HEAD); printf("\n/--------------------------\\"); printf("\n| Addr | Info | NEXT |"); printf("\n|--------|--------|--------|"); printf("\n| %-6u | %6d | %-6u | <== Current Node", curNode, curNode->info, curNode->NEXT); printf("\n| %-6u | %6d | %-6u | <== After Node", curNode->NEXT, curNode->NEXT->info, curNode->NEXT->NEXT); printf("\n\\--------------------------/"); printf("\nEnter New Info. For After Node: "); scanf("%d", &x); curNode->NEXT->info = x; Pause("Info. Changed Successfully."); } //--- Delete Begin Node. void DeleteBegin(void) { clrscr(); printf("\nDELETE BEGIN NODE:"); printf("\n~~~~~~~~~~~~~~~~~~"); if(*HEAD == NULL) { Pause("List Is Empty, Try Later."); return; } LinkList *curNode = *HEAD; printf("\nHEAD = %6u", *HEAD); printf("\n/--------------------------\\"); printf("\n| Addr | Info | NEXT |"); printf("\n|--------|--------|--------|"); printf("\n| %-6u | %6d | %-6u |", curNode, curNode->info, curNode->NEXT); printf("\n\\--------------------------/"); *HEAD = curNode->NEXT; free(curNode); Pause("Node Deleted Successfully."); } //--- Delete End Node. void DeleteEnd(void) { clrscr(); printf("\nDELETE END NODE:"); printf("\n~~~~~~~~~~~~~~~~"); if(*HEAD == NULL) { Pause("List Is Empty, Try Later."); return; } LinkList *curNode = *HEAD; if(curNode->NEXT == NULL) { printf("\nHEAD = %6u", *HEAD); printf("\n/--------------------------\\"); printf("\n| Addr | Info | NEXT |"); printf("\n|--------|--------|--------|"); printf("\n| %-6u | %6d | %-6u |", curNode, curNode->info, curNode->NEXT); printf("\n\\--------------------------/"); *HEAD = curNode->NEXT; free(curNode); } else { while(curNode->NEXT->NEXT != NULL) curNode = curNode->NEXT; LinkList *Node = curNode->NEXT; printf("\nHEAD = %6u", *HEAD); printf("\n/--------------------------\\"); printf("\n| Addr | Info | NEXT |"); printf("\n|--------|--------|--------|"); printf("\n| %-6u | %6d | %-6u |", Node, Node->info, Node->NEXT); printf("\n\\--------------------------/"); curNode->NEXT = curNode->NEXT->NEXT; free(Node); } Pause("Node Deleted Successfully."); } //--- Delete After Specified Node. void DeleteAfter(void) { int src; clrscr(); printf("\nDELETE AFTER ANY NODE:"); printf("\n~~~~~~~~~~~~~~~~~~~~~~"); if(*HEAD == NULL) { Pause("List Is Empty, Try Later."); return; } printf("\nEnter Node Info. After Which Node Is To Be Deleted: "); scanf("%d", &src); LinkList *curNode; curNode = Search2(src); if(curNode == NULL) { Pause("Given Info. Does Not Exist, Try Later."); return; } if(curNode->NEXT == NULL) { Pause("It Is Last Node, Hence Opeartion Can Not Be Performed. Try Later."); return; } LinkList *Node = curNode->NEXT; printf("\nHEAD = %6u", *HEAD); printf("\n/--------------------------\\"); printf("\n| Addr | Info | NEXT |"); printf("\n|--------|--------|--------|"); printf("\n| %-6u | %6d | %-6u |", Node, Node->info, Node->NEXT); printf("\n\\--------------------------/"); curNode->NEXT = curNode->NEXT->NEXT; free(Node); Pause("Node Deleted Successfully."); } //--- Delete All Nodes. void DeleteAll(void) { char yn; clrscr(); printf("\nDELETE ALL NODES:"); printf("\n~~~~~~~~~~~~~~~~~"); if(*HEAD == NULL) return; printf("\nAre You Sure To Delete All Nodes: "); fflush(stdin); yn = getche(); if(toupper(yn) == 'Y') { LinkList *curNode = *HEAD; while(*HEAD != NULL) { *HEAD = curNode->NEXT; free(curNode); curNode = *HEAD; } free(curNode); Pause("Node Deleted Successfully."); } } //--- Main Program Body To Show Menu Driven Choice For Operations. void main(void) { char choice; do { clrscr(); printf("\n/--------------------------------\\"); printf("\n| SINGLE LINK LIST MENU |"); printf("\n|--------------------------------|"); printf("\n| A. Insert Node At Begin. |"); printf("\n| B. Insert Node At End. |"); printf("\n| C. Insert Node After Any Node. |"); printf("\n| D. Traversal Of Link List. |"); printf("\n| E. Search Any Info In List. |"); printf("\n| F. Edit Begin Node Info. |"); printf("\n| G. Edit End Node Info. |"); printf("\n| H. Edit After Node Info. |"); printf("\n| I. Delete Begin Node. |"); printf("\n| J. Delete End Node. |"); printf("\n| K. Delete After Any Node. |"); printf("\n| L. Delete All Nodes. |"); printf("\n| M. Exit / Quit. |"); printf("\n|--------------------------------|"); printf("\n| * Enter Your Choice (A-M): |"); printf("\n\\--------------------------------/"); gotoxy(30, 19); fflush(stdin); choice = getche(); choice = toupper(choice); switch(choice) { case 'A': AddBegin(); break; case 'B': AddEnd(); break; case 'C': AddAfter(); break; case 'D': ViewAll(); break; case 'E': Search1(); break; case 'F': EditBegin(); break; case 'G': EditEnd(); break; case 'H': EditAfter(); break; case 'I': DeleteBegin(); break; case 'J': DeleteEnd(); break; case 'K': DeleteAfter(); break; case 'L': DeleteAll(); break; case 'M': Pause("Thankyou For Using This Demo Version. TATA, BYE-BYE."); break; default: Pause("INVALID CHOICE, Try Between A And M Only."); } }while(choice != 'M'); } //--- End Of File (EOF). |
If you found any mistake in the above C Program To Demo Single Link List Operations Version 1. then please mention it by commenting below.
