2.13 Reverse a Doubly Linked List | Data Structures & Algorithm Tutorials

preview_player
Показать описание
In this video I have written a C program to Reverse a Doubly Linked List as well as I have discussed how to reverse a DLL with example.

******************************************
See Complete Playlists:

**********************************************

Connect & Contact Me:

#doublylinkedlist, #jennyslectures, #linkedlist, #datastructures
Рекомендации по теме
Комментарии
Автор

This channel deserves more subscribers than other cs tutorials. Methodology of teaching is great.

StrollerEngineer
Автор

Kudos to you mam for the first time in long time am able to guess the next step of the programe. May you always stay blessed

mohammedumarfarhan
Автор

This was a great explanation! Very Clear and explains all steps very thoroughly. Thank you :)

fadelh
Автор

At the end of lecture when u say "till then bye bye take care" i just love thnku so ur videos are helping me

sagarkapoor
Автор

Great video! We could also traverse the list backwards from tail pointer till head and print the corresponding values.
struct node *temp;
temp=tail;
printf("The reversed LL: \n");
while(temp!=0){
printf("%d", temp->data);
temp=temp->prev;
}

sharathsanthosh
Автор

I haven't seen such a great explanation anywhere. You are great mam.

Ashish-xonh
Автор

Your videos are so helpful that after watching deletion in singly linked list, I have made programs for deletion in doubly linked list by myself😊😊

mansigoyal
Автор

Jenny mam you are absolutely great. Very knowledgable and very good way of delivering the content in all the videos. Keep it going mam. Loads of love and respect.

anushkapai
Автор

Love your teaching....i am from completely non technical background.

shatakshisharma
Автор

Amazing explanation . Thank you so much

bhojpuri-short
Автор

Addicted to ur vidioes and ur voice mam

bhanojaddala
Автор

Thank you so much, you are an amazing teacher.

chamnil
Автор

Thanks you so much for this amazing Lecture. now i understood this concept.

nirbhaynarain
Автор

can we do like this:
struct node* temp;
temp=tail;
tail=head;
head=temp;
and its reversed ?

theunknown
Автор

Done...! clearly explained..tnqq so much mam🥰

prabha
Автор

In whole video we get to see u smile only in the take care bye bye part😂.
Fab explanation mam

rachaelgreene
Автор

Very helpful video, thank you ma'am.

AISHWARIAROYSNIGDHA
Автор

Mam We can't do this???
void Reverse()
{
printf("\n Your Reverse Linked List....\n");
temp=tail;
while(temp!=NULL)
{
printf("%d\t", temp->data);
temp=temp->prev;
}
}
instead of Your Reverse Concept ???
please Reply Mam

somsk
Автор

Thanks a lot for making this concept easy

mukulrawat
Автор

Amazing thank you so much
you video always useful and the solution for my problems

moayyadarz