2.18 Reverse a Circular Linked List | Data Structure Tutorials

In this lecture, I have written C program to Reverse Circular Linked List. This is an important interview question. I have solved this using iterative approach.

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

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

Connect & Contact Me:

#circularlinkedlist, #jennyslectures, #linkedlist, #datastructures

[AbhinavSingh]

mam seriously you work really harder even you can just tell the whole video in 3-4 min as u told all this stuff in previous videos but you put efforts for us thank you mam

[Prologgaming]

Mam your videos are great hope I will pass this semester by watching your videos

[AshilPatel]

at 6:51, if we first check list is empty(tail=NULL) and after then we can assign current=tail->next then it's better (or) effective memory allocation...
NOTE:- *this is my point of you for reading Have a nice day!!!!...

[nishanty]

Mam attendance lelo
Nishant: Present Mam 😇
💗

[srinithis]

Mam awesome video I am learning these chapters only with ur help....can u post some videos related to java

[hamidullah]

Ma'am how will I learn the data structure. Like

[aranyakdas]

Mam you have described the process very nicely. Thanks a lot mam, this will help me alot ! :-)

[gangakoreddy]

=I THINK U HAVE MISSED * BEFORE NEXTNODE POINTER @5:55 MA'AM

[AISHWARIAROYSNIGDHA]

Very helpful video, thank you ma'am.

[citrus]

mam apko head nhi hatana chahiye tha for everything it plays main role

[muskankasere]

Mam this code does not reverse properly it doesn't reverse 1 node

[jogenderyadav]

mam is while loop me ( prev=current=nextnode ) kr skte hai
🤔🤔🤔🤔

[beastslayer]

mam if u are using tail in the cll then u can just traverse the list using tail and it will give u the reverse cll

[ritik]

// code to reverse circular linked list in SIMPLE WAY by using three pointer approach
void reverse(struct node * &head) // here just head of the circular linked list is passed as argument
{
struct node *p, *q, *r, *tail;
tail=head;
do{
tail=tail->next;
}
while(tail->next!=head);

p=head;
q=tail;
r=tail;
do{
r=q;
q=p;
p=p->next;
q->next=r;
}
while(p!=head);
head=q;

}

[sahilprasantachoudhury]

Self referential note: Code ta easily mane rakhiheba

[deepeshrathod]

Mam just used your technique of visualization and successfully reversed doubly circular linked list.
It's great thank you mam....

[sonalipaul]

mam i appriciate yor video . can you please make a php tutorial ?

[fangrider]

mam can you make video on REPRESENTATION AND MANIPULATION OF POLYNOMIALS USING LL

[madhurimadas]

Mam, there are 4 nodes so you took 3 pointer( previous, nextnode, current), what if there are 5 or 6 nodes? then how many pointers do we need to take? Or will that also work with 3 pointers only? Please clarify.

[SanjayYadav-lnji]

Watching your tutorials but paying to college😭