C++ Programming Code Examples

C++ > Beginners Lab Assignments Code Examples

Simple Singly Linked List Program in C++



Simple Singly Linked List Program in C++

Linked list is a linear collection of data elements, called nodes, each pointing to the next node by means of a pointer. It is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of data and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration. More complex variants add additional links, allowing efficient insertion or removal from arbitrary element references

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

using namespace std;

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

int main() {
    typedef struct node DATA_NODE;

    DATA_NODE *head_node, *first_node, *temp_node = 0;
    int count = 0;
    int loop = 1;
    first_node = 0;
    int data;

    cout << "Singly(Single) Linked List Example - Basic (Structure Example)\n";

    while (loop) {

        cout << "\nEnter Element for Insert Linked List (-1 to Exit ) : \n";
        cin>>data;

        if (data >= 0) {

            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;
            }
            head_node = temp_node;
            fflush(stdin);
        } else {
            loop = 0;
            temp_node->next = 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;

    return 0;
}