Linked List Logic

← Back to Visualizer

C++ Manual Implementation

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

// Insert at Front
void insertFront(Node** head, int val) {
    Node* newNode = new Node();
    newNode->data = val;
    newNode->next = *head;
    *head = newNode;
}

// Delete from End
void popEnd(Node** head) {
    if (*head == NULL) return;
    if ((*head)->next == NULL) { delete *head; *head = NULL; return; }
    
    Node* temp = *head;
    while (temp->next->next != NULL) temp = temp->next;
    delete temp->next;
    temp->next = NULL;
}

C++ Manual Implementation

struct Node {
    int data;
    Node* next;
    Node* prev;
};

// Insert at End (Doubly)
void insertEnd(Node** head, int val) {
    Node* newNode = new Node();
    newNode->data = val;
    newNode->next = NULL;
    
    if (*head == NULL) {
        newNode->prev = NULL;
        *head = newNode;
        return;
    }
    
    Node* last = *head;
    while (last->next != NULL) last = last->next;
    
    last->next = newNode;
    newNode->prev = last;
}

// Delete from Front (Doubly)
void popFront(Node** head) {
    if (*head == NULL) return;
    Node* temp = *head;
    *head = (*head)->next;
    if (*head != NULL) (*head)->prev = NULL;
    delete temp;
}