2.8 Reverse a Linked List - Iterative Method | Data Structure Tutorials
Вставка
- Опубліковано 7 лют 2025
- Jennys Lectures DSA with Java Course Enrollment link: www.jennyslect...
In this lecture I have written C program to reverse a singly linked list. I have followed iterative approach to solve this problem.
DSA Full Course: https: • Data Structures and Al...
******************************************
See Complete Playlists:
C Programming Course: • Programming in C
C++ Programming: • C++ Complete Course
Python Full Course: • Python - Basic to Advance
Printing Pattern in C: • Printing Pattern Progr...
DAA Course: • Design and Analysis of...
Placement Series: • Placements Series
Dynamic Programming: • Dynamic Programming
Operating Systems: // • Operating Systems
DBMS: • DBMS (Database Managem...
*********************************************
Connect & Contact Me:
Facebook: / jennys-lectures-csit-n...
Quora: www.quora.com/...
Instagram: / jayantikhatrilamba
#linkedlistindatastructure
#algorithms
#dsa
#operationsonlinkedlist
Finally someone who is teaching assuming the viewers are beginners.
This has to be the best linkedlist reversal video on the internet. Mam, you’re so good at breaking down such confusing logic into something so simple. You’re really blessed to be a teacher
Its easy mann
is it??
Use push method no need to do all things
@@Know_Youself if u know push method why did you watch and spend time in comment section
w wl 12
Teachers like you are needed seriously....who give not only theories and codes....but knowledge also....
No background music, No fancy introduction of channel or anything. Simple, to the point and perfect explanation. Thank you and God bless you.
because of you ma'am i've understood everything in singly linked list and here is the full code :
#include
#include
struct node {
int data;
struct node *next;
}*head,*newnode,*temp;
int pos;
int n;
void create(int n);
void print();
void addbig();
void addend();
void addspecific(int pos);
void delbeg();
void delend();
void delspecpos();
void getlength();
void reverse();
int main()
{
int num,choice;
while(1){
printf("
ENTER '1' TO CREATE LINKED LIST:
");
printf("
ENTER '2' TO ADD NODE AT BEGINNING:
");
printf("
ENTER '3' TO ADD AT NODE THE END OF THE LIST:
");
printf("
ENTER '4' TO ADD NODE AT SPECIFIC POSITION:
");
printf("
ENTER '5' TO DELETE THE FIRST NODE:
");
printf("
ENTER '6' TO DELETE LAST NODE:
");
printf("
ENTER '7' TO DELETE A NODE FROM SPECIFIC POSITION:
");
printf("
ENTER '8' TO GET LENGTH OF THE LIST:
");
printf("
ENTER '9' TO REVERSE THE LIST:
");
printf("
ENTER '10' TO EXIT:
");
scanf("%d",&num);
switch (num)
{
case 1:
create(n);
print();
break;
case 2:
addbig();
print();
break;
case 3:
addend();
print();
break;
case 4:
addspecific(pos);
print();
break;
case 5:
delbeg();
print();
break;
case 6:
delend();
print();
break;
case 7:
delspecpos();
print();
break;
case 8:
getlength();
print();
break;
case 9:
reverse();
print();
break;
case 10:
printf("bye bye :) !!");
exit(0);
break;
default:
printf("WRONG CHOICE...!");
}//end of switch statement
}//end of while
return 0;
}//end of main
void create(int n)
{
printf("enter the length of the list: ");
scanf("%d",&n);
struct node *newnode;
head=0;
int i;
for(i=0;idata);
newnode->next=0;
if (head==0)
{
head=temp=newnode;
}
else {temp->next=newnode;
temp=newnode;
}
}
}
void print()
{
temp=head;
printf("
the list is:
");
while(temp!=0)
{
printf("%d ",temp->data);
temp=temp->next;
}
}
void addbig()
{
struct node *newnode;
if (head==0)
{
printf("invalid position");
}
else
{
newnode=(struct node *)malloc(sizeof(struct node));
printf("
enter the data of new beginning node: ");
scanf("%d",&newnode->data);
newnode->next=head;
head=newnode;
}
}
void addend()
{
struct node *newnode;
temp=head;
if(head==0)
{
printf("invalied position");
}
else{
newnode=(struct node*)malloc(sizeof(struct node));
printf("
enter the data of new last node: ");
scanf("%d",&newnode->data);
newnode->next=0;
while(temp->next!=0)
{
temp=temp->next;
}
temp->next=newnode;
}
}
void addspecific(int pos)
{
int j;
printf("
enter position of newnode: ");
scanf("%d",&pos);
struct node *newnode;
if (pos>n||posdata);
for(j=0;jnext;
}
newnode->next=temp->next;
temp->next=newnode;
}
}
void delbeg()
{
printf("
first node will be deleted....
");
if (head==0)
{
printf("lsit is empty");
}
else
{
temp=head;
head=head->next;
free(temp);
}
}
void delend()
{
struct node *prevnode;
printf("
last node will be deleted....
");
temp=head;
while(temp->next!=0)
{
prevnode=temp;
temp=temp->next;
}
if(temp==head)
{head=0;
}
else{
prevnode->next=0;
}
free (temp);
}
void delspecpos()
{
int x;
int posi;
struct node *nextnode;
temp=head;
printf("
enter the position of node you want to delete: ");
scanf("%d",&posi);
for(x=0;xnext;
}
nextnode=temp->next;
temp->next=nextnode->next;
free(nextnode);
}
void getlength()
{
temp=head;
int count;
while(temp!=0)
{
count++;
temp=temp->next;
}
printf("
list length is: %d",count);
}
void reverse()
{
struct node *prevnode,*current,*nextnode;
prevnode=0;
current=nextnode=head;
while(nextnode!=0)
{
nextnode=nextnode->next;
current->next=prevnode;
prevnode=current;
current=nextnode;
}
head=prevnode;
}
Thank you for this
@@vineethnarayan5159 welcome
i'm about to take my exam of data structures and you made my day brother. Stay Blessed forever :)
@@aminaaslam33 all the best in your exams ,
good luck
maza aa gaya
Reversing the linked list is always a confusing stuff for me. But finally I got this concept clear with your unique style of explanation. Very grateful to you MadamJi ... !
Dear Jenny,
You seem to enlighten us on a daily basis. Your way of teaching is very simple and yet very impacting. Thank you for all you have done/posted. 😊😊 Wish you all success in life and career.
I have 20 years of development experience in industry but still I have found reversing a linked list to be quite difficult, until that is I came across this excellent video.
This is my favorite u tube channel to learn data structure and algoritham... thanks mam💻
Finally someone who is teaching assuming the viewers are beginners. Subscribing the channel for more viewership and exposure. Good luck. We really dont mind the long length of the videos.
😂😂😂😂😂
YOU'RE TRUELY ONE OF THE FINEST TEACHERS!!
Hi Ma'am Happy Teachers Day....Ma'am Your Teaching is so Understandable that any Below Average Students can also easily Grasp the Concepts..Jayanti Ma'am please Cover all the Concepts of "Advanced Data Structures & Algorithms" without leaving even a Single Concept...You are also having so "Beautiful Face along with Beautiful Voice & Genius Brain"💐🎂...You will Definitely become one of the Reputed UA-cam Professor in front of the Whole World...I will be waiting for that Day👍
Thanks you ... :)
Most simple and clear explanation I've come across so far . Keep us providing with more of these wonderful videos. Much appreciated !
Thanks a lot for making us understand this easily. I went through a lot of videos but yours is actually the "BEST" one.
Finally a video for all
levels of students.Its deeply intriguing and really helps boulangerie of epic proportions
Whenever i watch your video it feels like i was sitting in the classroom. I spent my whole one day but not find out how to reverse. finally after watching this video i solve the problem in minutes.
Blessed, thrilled, excited all at the same time to have a teacher like you!!
I can't believe the way she taught...mindblowing hatts off to ur efforts mam!!🎉🎉🔥
This is my favorite youtube channel to learn whatever course in computer science......i lv u so much mam
feel like tuition class.. thank you madam .. from Nepal
Hai bro!! Malai pani testai lagchha
Just one word for u mam "ZABARDAST" .
GREAT explanation and simple style, and i loved my all teachers but u r one of the best teacher ever on dsa.😍😍😍😍
Best UA-cam channel for data structure ☺️
Madam you have a lot of patience....while learning in my class I faced lot of confusion but now my all doubts are clarified..your doing greatest service for the poor people that who are not able to invest..thank you is very small word but it contains lot of emotional feeling 🙏
never have i ever been taught like this before.... concepts are so clear to me now that I can bloody teach someone.
omg, I'm a girl and I wanna say I love you! You are such a good teacher who makes this complicated knowledge into something clear and understandable. Thank you! Appreciated all your work!🥰🥰🥰
Love you too
Seeing just the first 5 mins of this video got me clear the whole traversal & reversal process. Thanks for such a wonderful content!
PERFEITA MARAVILHOSA SEM DEFEITOS, toda vez que tenho que reverter uma lista eu colo aqui
Excellent explanations Jenny ...
God bless you !!!!
Thank you so much Ma'am, your explanations are so easy to understand !!
Ur teaching skills are really awesome... simple and concise... I understood this concept... Ur doing invaluable service in CS teaching in India. U really deserve President award for teaching..Hats off u ..Maam..
I've subscribed ❤ thank you for explaining it so easily and clearly, finally I understood how to reverse linked list after coming across many complicated videos
Bestest explanation of reverse linked list , for your struggle I have clear knowledge in DSA, thankyou ma'am ❤
Truly Grateful for these lectures ~
Your schematic representation are best. Thanks a lot!
Last year I got A+ in the discrete mathematics course watching your video. Now I am watching DS videos .. (Love from Bangladesh
your are the best teacher i have ever seen
Being in the Final year and preparing DS and ALGO for placement. What have I learned from college NOTHING. What have I learn from you is the logic behind those from scratch. You have my utmost respect. I will again comment you when I will get a Job.
Stay happy, stay safe and take care Ma'am .:-)
Best wishes
@@JennyslecturesCSIT Thank you Ma'am😊
very nicely explained. exceptional style of teaching. god bless you . thanks
Sabse acha data structure apne padhaya h...mene ummid hi kho di thi....god bless you........or bhi vedio bnado maim....Hindi me record krdo possible ho ske to
Finally found a video that explains the concept so systematically! Thanks a lot!
Thank you, Jayanthi.. explanation is awesome. Straight to the basics... no need to memorize.. all logical
I love your way of teaching PLEASE do a video of how to delete all negative numbers in a linked list
today I taught my frnd linked list after learning from your video & he was like wow !! bhot acche se explain Kiya phli Baar mein hi sab smjh aagya...Thnq soo much mam, U teach soo well
ma'am your level of explanation is really very helpful... and understandable. their are lot of video on ds on different platform i visited almost source possible for learning ds but i don't find any video content around you .... this is best content i ever seen on d.s ..ma'am small love from younger brother ..from bihar..
woaw ma'am ! your teaching skill is absolutley faad👌👌, many more teachers and lectures on you tube but i love the way you teach !
when im free i will draw your beautiful sketch 🙌🙌
Thanks a lot mam....you are working hard for us.....perfectly explained everything .
Ever hear these kind of lectures.Thank u mam for providing better lectures for us.❤❤❤
Extraordinary Teaching Skills 🙇♂🙇♂
ALWAYS I SUPRISED BY YOUR TEACHING MAM, IT's BEEN LIKE SPOON FEEDING VERY EASY TO UNDERSTAND MAM, THAN YOU SO MUCH
Liked the teaching approach. What we might miss when traversing and the logic to hold them. Nice.
Thanks.
One of the easiest way to reverse linkedlist
Great work ma'am
Keep it up 👍
Good explanation Jenny! I could understand logic in 5 mins and create my own program
greatest instructor of all time 🙏🙏🙏
Thank You So much by far the best Reversal Video !!!
She's dope man😍😍😍
DS and ALGO MADE BEAUTIFUL😌
I am grateful to you for this video. It helps me alot thanks!
Thank You Mam So So Much🙏🙏🙏🙏
best explanation for reversing the linked list. Thank you maam!
Very beautifully explained ...the working you have made us visualize it
Very clear explanation thank you from Egypt
Mam your lec so helpful ... I understand all points very well❤❤ ...great work 👍👍
The way she smiles at end of every video is love......till then bye bye take care...
greatest work by the most beautiful youtuber.
thanks mam
Mam ji namste 🙏🏼🙏🏼
Your teaching way is very very admirable
Thanku mam... Finally I can understand this topic...
I took cormen. Left it. I downloaded tens of books. I read , I yawned and I stopped. Suddenly one day this video pops up on my youtube screen. Woaaah, my mind said.
✌🥳✌
Your explanation is so clear..thanku mam
this is what student is always looking for!!!!!
FINE 👍
Awesome Teaching Mam!!!
Big Fan Ma'am From Pakistan
Stay Blessed
Thanks mam for sharing your knowledge. It helped me a lot
Thank you very much mam. you made me learn without skipping backwards😊😊😎😎
mam instead of taking extra variables we can just assume head as a previous node since at last it will be pointing to last node. I think in this way we can save memory
Mam your lectures are awesome. Keep it up for us. Best wishes.
Sabse pahle tah-e-dil se shukriya.
Ek sawal hai, zehan me. Kyu na while loop ki shuruati line ye ho
nextnode = currentnode->next;
bajaye isake
nextnode = nextnode->next;
Ye dono mere mutabik ek hi tarah se kam karengi, lekin dimag ke liye uper wali line jyada asardar hogi
Your teaching method is awesome sis
she has awesome teaching skills
Speechless, mind blowing explanation mam....keep going and we are looking forward for more easy understanding, useful concepts like this.... Fan from Andhra Pradesh....
Nice explanation indeed, and reversal of string can be done using 2 pointers, 3rd extra pointer not required.
Thank you so much ma'am God bless you and ur family
Hi mam, I am from ece stream and not familiar with how to calculate the timing complexity of an algorithm. I have understood a little about big O notation from ur explanations but if u could make a separate video, that would be very helpful.
Your way of explaining is very good and clear. These videos are very helpful. Thanks mam☺️
best teaching method
Thank you mam... Very Helpful for umcoming gate and net exam
DAY 12 COMPLETED
Bro job vachinda
Thanks a lot ma'am! Very helpful
struggled for 40mins without any direction, finally understood.
Thank you so much for your efforts.
thank you so much for this beautiful explanation mam.
Mam aap abhut accha samjhate ho keep it up mam you are the only one with great content aman bhaiya ka bhi course accha hai but explaination for beginers is very poor
Wow mam 1 time me clear ho gya...... thanks
your amazing!! i love you Teacher🥰🥰🥰
Nice lecture mam ji 😍
Best explanation .....Thank you Mam☺
Thanqu soooooo much mamm your explanation is too good ...
super mam.
i request you to post video on interview question and answer also please.
then post video on mirror program in c.
You have to agree that you taught me and i simply learnt
Code with Harry and Miss Jenny. They are performing much more better than so called PHD stupid scholars in the University. Love from Pakistan!
excellent explaination madam ji
thanku mam ,I love only your videos !!!