Circular Doubly Linked List (Insertion at the End)

Data Structures: Insertion at the End of a Circular Doubly Linked List
Topics discussed:
1) C program for inserting a node at the end of a circular doubly linked list.

Music:
Axol x Alex Skrindo - You [NCS Release]

#DataStructuresByNeso #DataStructures #CircularDoublyList #LinkedList

[brijusingh]

Thanks you sir...now video uploaded frequency is

[ShivamRajput-mper]

Sir, we want course of Advance Data structure and algorithm!
Btw your video is really help us!
Thank you

[aparnapathak]

Sir I request you to please make a playlist for DAA and Software Engineering.🙏🏻🙏🏻

[gaurav]

I just came accross your channel n wondering how do you know everything! Like seriously

[monicabattacharya]

Dear Neso Academy , Please reply what is the difference between datastructures and advanced datastructures?

[ayushpatel]

Sir I want to start watching this playlist but I see that this play list is not complete can I know how much time will it take to get completed

[daljeetsingh]

or we can do it with single pointer only
struct node *add_at_end(struct node *tail, int data)
{
struct node *ptr=malloc(sizeof(struct node));
ptr->prev=tail;
ptr->data=data;
ptr->next=tail->next;
tail->next=ptr;
tail=tail->next;
return tail;
}

[balakrishnaprasad]

sir we want the course on computer organization and architecture

[shriyajoshi]

what is the total no of videos, that r gonna b posted for this particular playlist ?, and how much approximate time would it take for u to complete posting all the videos of this playlist? :)

[aizajsamani]

you can add new Node at the end with using tail pointer also
struct Node* addATEnd(struct Node* tail, int val)
{
struct Node* newN = (struct Node*)malloc(sizeof(struct Node));
newN->prev = newN;
newN->data = val;
newN->next = newN;

if(tail == NULL)
return newN;

newN->next = tail->next;
tail->next->prev = newN;
tail->next = newN;
tail = newN;

return tail;
}