Singly Linked List Example Program in C++


Definition

  • Insert in Linked List
  • Delete node in Linked List based on position
  • Display Nodes in Linked List
  • Count Nodes in Linked List

Singly Linked List Example Program ( Insert, Delete, Display and Count)

/* Singly Linked List C++ Example - All Operations Example Program Using Functions in C++*/
/* Data Structure C++ Programs,C++ Linked List Examples */
/* Singly Linked List C++ Example - Insert,Delete,Display and Count C++ Operations*/

#include <iostream>
#include<conio.h>
#include<stdlib.h>
#include<stdio.h>

using namespace std;

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

void insert();
void display();
void delete_node();
int count();

typedef struct node DATA_NODE;

DATA_NODE *head_node, *first_node, *temp_node = 0, *prev_node, next_node;
int data;

int main() {
    int option = 0;

    cout << "Singly Linked List C++ Example - All Operations\n";

    while (option < 5) {

        cout << "\nOptions\n";
        cout << "1 : Insert into Linked List \n";
        cout << "2 : Delete from Linked List \n";
        cout << "3 : Display Linked List\n";
        cout << "4 : Count Linked List\n";
        cout << "Others : Exit()\n";
        cout << "Enter your option:";
        scanf("%d", &option);
        switch (option) {
            case 1:
                insert();
                break;
            case 2:
                delete_node();
                break;
            case 3:
                display();
                break;
            case 4:
                count();
                break;
            default:
                break;
        }
    }

    return 0;
}

void insert() {
    cout << "\nEnter Element for Insert Linked List : \n";
    scanf("%d", &data);

    temp_node = (DATA_NODE *) malloc(sizeof (DATA_NODE));

    temp_node->value = data;

    if (first_node == 0) {
        first_node = temp_node;
    } else {
        head_node->next = temp_node;
    }
    temp_node->next = 0;
    head_node = temp_node;
    fflush(stdin);
}

void delete_node() {
    int countvalue, pos, i = 0;
    countvalue = count();
    temp_node = first_node;
    cout << "\nDisplay Linked List : \n";

    cout << "\nEnter Position for Delete Element : \n";
    scanf("%d", &pos);

    if (pos > 0 && pos <= countvalue) {
        if (pos == 1) {
            temp_node = temp_node -> next;
            first_node = temp_node;
            cout << "\nDeleted Successfully \n\n";
        } else {
            while (temp_node != 0) {
                if (i == (pos - 1)) {
                    prev_node->next = temp_node->next;
                    if (i == (countvalue - 1)) {
                        head_node = prev_node;
                    }
                    cout << "\nDeleted Successfully \n\n";
                    break;
                } else {
                    i++;
                    prev_node = temp_node;
                    temp_node = temp_node -> next;
                }
            }
        }
    } else
        cout << "\nInvalid Position \n\n";
}

void display() {
    int count = 0;
    temp_node = first_node;
    cout << "\nDisplay Linked List : \n";
    while (temp_node != 0) {
        cout << "# " << temp_node->value;
        count++;
        temp_node = temp_node -> next;
    }
    cout << "\nNo Of Items In Linked List : %d" << count;
}

int count() {
    int count = 0;
    temp_node = first_node;
    while (temp_node != 0) {
        count++;
        temp_node = temp_node -> next;
    }
    cout << "\nNo Of Items In Linked List : %d" << count;
    return count;
}

Sample Output

Singly Linked List Example - All Operations

Options
1 : Insert into Linked List
2 : Delete from Linked List
3 : Display Linked List
4 : Count Linked List
Others : Exit()
Enter your option:1

Enter Element for Insert Linked List :
100

Options
1 : Insert into Linked List
2 : Delete from Linked List
3 : Display Linked List
4 : Count Linked List
Others : Exit()
Enter your option:1

Enter Element for Insert Linked List :
200

Options
1 : Insert into Linked List
2 : Delete from Linked List
3 : Display Linked List
4 : Count Linked List
Others : Exit()
Enter your option:1

Enter Element for Insert Linked List :
300

Options
1 : Insert into Linked List
2 : Delete from Linked List
3 : Display Linked List
4 : Count Linked List
Others : Exit()
Enter your option:1

Enter Element for Insert Linked List :
400

Options
1 : Insert into Linked List
2 : Delete from Linked List
3 : Display Linked List
4 : Count Linked List
Others : Exit()
Enter your option:1

Enter Element for Insert Linked List :
500

Options
1 : Insert into Linked List
2 : Delete from Linked List
3 : Display Linked List
4 : Count Linked List
Others : Exit()
Enter your option:3

Display Linked List :
# 100 # # 200 # # 300 # # 400 # # 500 #
No Of Items In Linked List : 5

Options
1 : Insert into Linked List
2 : Delete from Linked List
3 : Display Linked List
4 : Count Linked List
Others : Exit()
Enter your option:4

No Of Items In Linked List : 5

Options
1 : Insert into Linked List
2 : Delete from Linked List
3 : Display Linked List
4 : Count Linked List
Others : Exit()
Enter your option:2

No Of Items In Linked List : 5

Display Linked List :

Enter Position for Delete Element :
3

Deleted Successfully


Options
1 : Insert into Linked List
2 : Delete from Linked List
3 : Display Linked List
4 : Count Linked List
Others : Exit()
Enter your option:3

Display Linked List :
# 100 # # 200 # # 400 # # 500 #
No Of Items In Linked List : 4

Options
1 : Insert into Linked List
2 : Delete from Linked List
3 : Display Linked List
4 : Count Linked List
Others : Exit()
Enter your option:2

No Of Items In Linked List : 4

Display Linked List :

Enter Position for Delete Element :
6

Invalid Position


Options
1 : Insert into Linked List
2 : Delete from Linked List
3 : Display Linked List
4 : Count Linked List
Others : Exit()
Enter your option:
5


------------------
(program exited with code: 0)

Press any key to continue . . .