C++ : Lecture 8: Deletion from End in Singly Linked List : Mastering Linked List Made Simple !

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

Deletion from End in Singly Linked List Code [C++] :

#include<iostream>

using namespace std;

class Node{

    public:

    int data;

    Node* next;

    //Constructor

    Node(int data){

        this->data = data;

        this->next = NULL;

    }

};

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

    // Step 1: EMpty list

    if(head == NULL){

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

        return;

    }

    // Step 2: Non-empty list

    Node* temp = head;

    while(temp->next != tail){

        temp = temp->next;

    }

    tail = temp;

    temp->next = NULL;

}

 

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

    // Creation of new Node

    Node* newNode = new Node(data);

    // CHeck if the list is empty

    if(head == NULL){

        head = newNode;

        tail = newNode;

        return;

    }

    newNode->next = head;

    head = newNode;

}

 

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

    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;

    insertAtBeginning(head,tail,10);

    insertAtBeginning(head,tail,20);

    insertAtBeginning(head,tail,30);

    insertAtBeginning(head,tail,40);

    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:

- Concepts

- Cases for Deletion

- Implementation

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:45 Concept of deletion

2:15 Approach

2:40 Handling empty list case

3:07 Handling non-empty list case

13:25 Code

16:56 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