Reverse Singly Linked List | Data Structures using C 

Please Comment, Subscribe and Click Bell🔔🔔🔔 Icon for More Updates. To learn software course from our experts please register here for online training: goo.gl/HIB0wL

sir your video are literally worth enough ..!!apart from this your knowledge your gesture your way of explanations set the platform to different level..!! hands up to u sir👏👏

That was excellent .. I went through so many videos to get the concept and honestly this was the best...

You are an excellent teacher sir , you clear the concepts so well . So glad i found this channel.

u r great sir...make tough pblm very easy

Sir your video is worth watching .. Never had such clear conception ... a thank you wont be enough !

Love and respect form Bangladesh ! You are an awesome teacher Sir !

I am not tired of to comment on your every vedio ,👍👍👍

Sir, your explanation is great! I am very thanks full to you.

I watched ur complete playlist...that's really helpful for fresher students

Sir, Please upload All sorting programs Sir, I am a great fan of yours teaching. I studied C from you in Ameerpet and studying data structure from youtube... Please...Uploading all sorting programs.ASAP as it great time for us in Bangalore to get a job.

Sir can u explain merging of two linked lists please sir

Simple and to the point Naresh!

HERE IS THE COMPLETE CODE: It includes all functions of linked list tought in this channel. To watch the code of only this video, Please see the void reverse() function only: #include #include struct node { int data; struct node* link; }; struct node* root = NULL; int len; void append(); void addatbegin(); void addatafter(); int length(void); void display(); void delete(); void reverse(); void main() { int ch; while(1) { printf("Single linked list operations are: "); printf("1.Append "); printf("2.AddAtBegin "); printf("3.AddAtAfter "); printf("4.length "); printf("5.delete "); printf("6.display "); printf("7.Reverse "); printf("8.Exit "); printf("enter your choice: "); scanf("%d",&ch); printf("Your choice was: %d ",ch); switch(ch) { case 1: append(); break; case 2: addatbegin(); break; case 3: addatafter(); break; case 4: len = length(); printf("length is %d ",len); break; case 5: delete(); break; case 6: display(root); break; case 7: reverse(); break; case 8: exit(0); default : printf("invalid input "); } } } void append() { struct node* temp; temp=(struct node*)malloc(sizeof(struct node)); printf("Enter node data "); scanf("%d",&temp->data); temp->link=NULL; if(root==NULL) { root= temp; } else { struct node* p; p=root; while(p->link!=NULL) { p=p->link; } p->link=temp; } } void display(struct node* temp) { if(temp==NULL) { printf("list is empty "); } else { printf("elements are: "); while (temp != NULL) { printf(" %d ", temp->data); temp = temp->link; } } printf(" "); } int length() { struct node* temp; int count=0; temp=root; while(temp!=NULL) { count++; temp=temp->link; } return count; } void addatbegin() { printf("to be build "); } void addatafter() { struct node* temp; int loc; printf("Enter location after which, node to be inserted: "); scanf("%d",&loc); if(loc>length()) { printf("invalid input position: "); printf("current list is having %d nodes only",length()); } else { int i=1; struct node* p=root; while(ilink; i++; } temp=(struct node*)malloc(sizeof(struct node)); //new node creation printf("enter new node data: "); scanf("%d",&temp->data); temp->link=NULL; //now just link this new node //first make right connection temp->link=p->link; //right connection p->link=temp; // left connection } } void delete() { struct node* temp; int loc; printf("Enter node number to be delete: "); scanf("%d",&loc); if(loc>length()) printf("invalid position input "); else if (loc==1) { temp=root; root=temp->link; temp->link=NULL; free(temp); } else { int i=1; struct node* p=root; struct node* q=p; while(ilink; i++; } q=p->link; p->link=q->link; q->link=NULL; free(q); } } void reverse() { struct node* p=root; struct node* q=root; int i=0,temp, j=length()-1; while(idata; p->data=q->data; q->data=temp; p-p->link; q=root; i++; j--; } }

Sir nijamga mi antha clear ga evaru cheypaleru miku Nijam ga johar entha cheypina takuvey sir mi gurunchi

very,very,,,,,,,nice sir your videos your explanation morvelessss

Sir, u have given us a wonderful explanation

This magic happens in the time complexity at the order of N square.

thank u so much this is life saviiing man

Easy to understand ..Thank you

very helpful for me

Sir you are awesome..😄😄

fabulous explanation.

Instead of reinitialising q we can add j-i in the while loop. I guess it computes to the same

Pass kra diya bhaishab aapne

Sir , in case of implementing the reverse linked list , why length is used?

Sir please upload the video about addition of two polynomial

awesome video sir but you didnt define the variable k

Sir your lectures are best

God of Data Structure

Sir will you please explain reversing singly linked list elements along with there corresponding addresses.

Thank you sir very great explainanation

sir plzz implement all logics in pc or laptop sir

sir what about the time complexity of the code given?

tq sir ,clear expalnation

sir,u are initially choosing the elements in increasing order.so in case of reversing swapping helps.what if the elements are not sorted

Sir ,can you show how will you create struct Node in which you can store the root and pointers and also best and worst cases! Thanks!

very nice explanation could you please post reverse double linked list and tress like BST,AVL tress operations,hashing also iam looking for your posts please post ASAP

More helpful video, sir.tq

Respected Sir I have understood very well but having problem in printing the reverse linked list how to print it can you please explain in text or any other way I'll be very thankful to you

sir, i need to learn data structures completely but i did not find data structures in online training

U r amazing sir!!!! :)

Thank You

Isnt this algorithm O(N2)?

Best explanation

good xplanation

Sir, can't we take i=1 and j=len??

One question, I thought root will point to last node in the linked list and address will be reversed.

Thank you so much sir!

Please explain other topics of data structures

Sir please explain how i become 0 and J become 3

make the videos on data structure using java, please

i wish you were using java :( but i liked your videos :) please make videos in data structure in java.

Thanks👌

Thank u sir

Sir u mistakenly explained as I=0 and j=4 after first iteration actually it's I=1 and j=3

Thank you sir..

Good explanation sir

complete this playlist and arrange videos in correct manner

Tqqqqq. Sir

sir what we do when eleemnt in array is 5 if u swap 0with4 and 1wit3 and then which elemet weselect to swap wit loc 2 element

Awesome

Super

K variable is not declared. And temp pointer variable also.

plzz implement all operations in laipi sir

Sir, I executed the code but reverse order of linked list is not coming perfectly..it is reversing in inorder sir, please help me in this anybody

just awesome

Sir, don't we need to reverse the link part too?

good Sir

and we need to create a local variable temp by using "struct node* temp"

for this method, it is mandatory that the list should be arranged in ascending order first otherwise it fails

thank u

Reverse function can be written simpler by changing only links

Sir why you are writing after i++ and j-- P P.data Q root Pls explain sir😔😔

What happens if the array consists 7 elements

All the program implementations are available here :) houseofgeek.in/single-linked-list-operations/

Sir why there is nested while , I can't get that can any one please explain me

sir all things are good but sir you didn't reversed middle element

Hats off

Radix sort

//all sll oprations #include #include using namespace std; struct node{ int data; node *next; }; struct node *temp,*temp1,*head,*tem; int len=0; //head=NULL; void insertatend(){ temp=new node; int e; coute; temp->data=e; temp->next=NULL; if(head==NULL){ head=temp; } else{ temp1=head; while(temp1->next!=NULL){ temp1=temp1->next; } temp1->next=temp; } } void display(){ if(head==NULL){ coutnext; temp->next=tem; } } void delet(){ int pos; coutpos; if(head==NULL){ coutnext=tem->next; free(tem);}} int length(){ temp=head; while(temp!=NULL){ len++; temp=temp->next; } return len; } void reverse(){ int i=0; int j=length(); node *p,*q; //p=new node; //q=new node; p=head; q=head; int t,k; while(idata; p->data=q->data; q->data=t; i++; j--; q=head; p=p->next; } cout

Not effective in terms of complexity, sorry can't agree

You are saying arrays

Why k is used

👏👏

Explanation is good . But solution is not efficient ,space and time complexity will be more.

how 'i' value is 0 and 'j' value is 3 at 14:12 min

Heap sort

this is a BAD implementation to reverse single linked list! Because there is a great overhead when swapping the data of 2 nodes, and the time complexity is O(n^2) because you have to access linked list each time when going to the position j ! Besides, you can Google for a best solution, maybe it's about O(n) time and just swap the pointer but not the data!

🙏🙏🙏🙏

it was so hard

Not efficient n optimized algo

not effective program . time complexity will be n^2 for it .

Super