Linked-List

Introduction to Linked list

A Linked List is a linear data structure where elements (called nodes) are stored in memory non-contiguously, and each node points to the next node using a pointer.

Key Properties

• Dynamic Size: Can grow/shrink at runtime.
• Efficient Insertion/Deletion: Especially at the beginning/middle.
• Sequential Access: No direct access to elements (unlike arrays).
• Each Node: Stores data & Has a pointer to the next node

Types of Linked-list

• Singly Linked List - points to next node only
• Doubly Linked List - points to both next and previous nodes
• Circular Linked List - last node points to the first

Example in C++

#include 
using namespace std;

// Node structure
struct Node {
    int data;
    Node* next;
};

// Function to print the linked list
void printList(Node* head) {
    Node* temp = head;
    while (temp != nullptr) {
        cout << temp->data << " -> ";
        temp = temp->next;
    }
    cout << "NULL\n";
}

int main() {
    // Creating nodes
    Node* head = new Node{10, nullptr};
    head->next = new Node{20, nullptr};
    head->next->next = new Node{30, nullptr};

    // Print the list
    printList(head);

    return 0;
}

    

Learning resource

Readings Linked-List
Videos Linked-List