Reversing a linked list

Check out our Discord server: / discord

[@jameslaurino9158]

I remember when I studied data structure. Your course help me a lot to understand the core logic. It's always seems not easy in C or C++ language especially for beginner but learn it is really useful. For instance to understand how high level languages like Java, c#, etc. work with that. It's a very important topic. And thank you to explain it in a really great way. I always recommend your channel for my student and for everyone who want to learn C even if they don't speak English like me :) . Keep going!

[@Woshii1]

Your videos are amazing. You're a great teacher. Keep it up!

[@n33to]

Thank you, you’re a marvelous teacher. 👍🏻💻📚

[@LuigiDiPaolo-vw4xs]

Great explanation, thank you

[@bernalgas-oo6gu]

thank you ma bro

[@rawadbader4441]

I think it would be easier to understand the logic oh you're switching the nodes around because I got so confused when you explained it I had to run it in the deguber to understand what happened. Basically current, previous, and next they are like sublist after they go inside the function this why you were able to switch them around.

[@tarekhamdoudi3144]

Thank you for the explanation. My question is what if the linked list is more than 3 elements long?

[@CodeVault]

The same program should work for any number of elements in the linked list. It was just easier to explain using 3 elements

[@user-ir8nd6mj2b]

9:30 my recursive solution: ``` Node *reverse(Node **node, Node *prev) { if(*node == NULL) return prev; Node *next = (*node)->next; (*node)->next = prev; return *node = reverse(&next, *node); } ``` Just call it like that: reverse(&root, NULL);