C++ : Lecture 14: Deletion from End in Doubly Linked List : Mastering Linked List Made Simple !

 Mastering Linked List Made Simple: Your Easy Guide to Data Structures !

Deletion from End in Doubly Linked List code [C++] :

#include<iostream>

using namespace std;

class Node{

    public:

    int data;

    Node* next;

    Node* prev;

    Node(int val){

        this->data = val;

        this->next = NULL;

        this->prev = NULL;

    }

};

void insertAtBeg(Node* &head, Node* &tail, int data){

    // Step 1: Create a new Node

    Node* newNode = new Node(data);

    // Step 2: Handle empty list case

    if(head == NULL){

        head = newNode;

        tail = newNode;

        return;

    }

    // Step 3: Handle non-empty list case

    newNode->next = head;

    head->prev = newNode;

    head = newNode;

}

void delFromEnd(Node* &head, Node* &tail){

    // Step 1: Empty list

    if(head == NULL){

        cout<<"List is empty";

        return;

    }

    // Step 2: Non empty list

    tail = tail->prev;

    tail->next->prev = NULL;

    tail->next = NULL;

}

void print(Node* head, Node* tail){

    if(head == NULL){

        cout<<"List is empty."<<endl;

        return;

    }

    Node* temp = head;

    while(temp!=NULL){

        cout<<temp->data<<" ";

        temp=temp->next;

    }

    cout<<endl;

    cout<<"Head: "<<head->data<<endl;

    cout<<"Tail: "<<tail->data<<endl;

}

int main(){

    Node* head = NULL;

    Node* tail = NULL;

    insertAtBeg(head,tail,5);

    insertAtBeg(head,tail,4);

    insertAtBeg(head,tail,3);

    insertAtBeg(head,tail,2);

    delFromEnd(head,tail);

    delFromEnd(head,tail);

    print(head,tail);

    return 0;

}

Hey, thanks for watching our video about Linked list ! In this video we’ll walk you through:

- Concept

- Cases in deletion

- Dry run

- Code

All codes are available at my GitHub account, check them out here:

https://github.com/shyamkanth/Placements

Check out other videos from DS Revealed playlist: https://www.youtube.com/playlist?list=PLNXqJgOsTCZOB60T9HDhMf_o8RXbNWgqS

Check out our channel here: https://www.youtube.com/@DevelopersByte

Find us at: https://shyamkanth.github.io/

Timestamps:

0:00 Intro

0:33 Concept

1:44 Approach

2:27 Handling empty list case

3:01 Handling non-empty list case

11:17 Code

13:26 Output

13:58 Outro

About our channel:

Our channel is about Revealing the secrets of Data Structure. We cover lots of cool stuff such as Codes, Concepts and Implementations.

Check out our channel here: https://www.youtube.com/@DevelopersByte

Don’t forget to subscribe!

Follow me on social media:

Get updates or reach out to Get updates on our Social Media Profiles!

GitHub: https://github.com/shyamkanth/

Instagram: https://instagram.com/still_23.6_8

Instagram personal: https://instagram.com/itz_sammmii