Doubly Linked List (Solved Problem 1)

Data Structures: Solved Problem on Doubly Linked List
Question discussed:
Consider the implementation of an unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time?
1) Insertion at the front of the linked list.
2) Insertion at the end of the linked list.
3) Deletion of the front node of the linked list.
4) Deletion of the last node of the linked list.

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

#DataStructuresByNeso #DataStructures #DoublyLinkedList #LinkedList

[DeepakSharma-hscs]

Awesome sir, This teacher deserves millions of likes and subscribers. Salute to u sir...excited for next part

[_rounakraj]

You are the best teacher which I ever seen

[ritikshrivastava]

Sir please make videos fast we already completed all the videos and want that by the end of this year data structure video's series is completely complete

[lawrencemuthui]

We can also use the tail pointer to delete the last node without declaring another pointer
tail = tail->prev;
free(tail->next);
tail->next = NULL;
Thanks Neso

[souravbhagat]

Sir please make a vedio lecture on Compiler design ..

[tahamanna]

some valuable content, thank you neso academy.. your videos are so helpful ♥

[amishalunia]

Sir in deletion of the front node part
We don't need to make the second node prev part null?

[ronniesam]

here we need to NULL the head->prev part of the updated node.(Deletion of the first node)

[wasimshaikh]

#BettermentofUs Sir it's a humble request to you please make a playlist for python programming. We are have a lots of python tutorial on yt..but they are not efficient and understandable.So please look towards it

[shreyapaul]

Please somebody tell is this following new b tech syllebus?
Please reply.
then I'll start from the 1st one.