Reverse a Linked List: Recursive | Java

Covers how to reverse a linked list using a recursive approach. Code in Java!
Checkpoints:
0:11 -- Concept Review (explaining the problem)
2:30 -- Implementation (the code & reasoning behind it)
13:30 -- Try it out on an example! (testing out our code)
Notes for watchers:
The signature for the Try It Out code implementation should be 'public Node reverse(Node curr)'. Sorry for the error!
== Learn More! ==
Iterative Solution:
• Reverse a Linked List:...

[@adamguida5910]

Really exceptional explanation. I'm not sure I've ever seen a better breakdown of the problem.

[@kenchen3902]

Love that "Try It Out" part!!!!! extremely useful!!! I was eager to now how exactly the recursive program runs and those pointers are too much to keep tracking.

[@annabellesun4719]

Looked up several videos but was still confused until I watched yours, really helped me out of the day, thank you!☺

[@bik8353]

many people have the skill but very few can teach it. You sir, are rare.

[@kseniaksu4007]

Thank you so much!!!! Your explanation was the only one I understood out of all including my prof's lol.

[@spartacusche]

best explanation, the only one who mastered the recursive call explanation

[@shahnawazhussain5538]

I have been looking for this explanation all over the internet and you were my savior. Could't get a better explanation. Subscribing to your channel.Looking forward to similar awesome content.

[@whogashaga]

Thanks for sharing this!
This is the best explanation I've ever seen.

[@atakan347]

Best explanation i’ve seen so far. The last solution of recursive calls made even more easier to understand it. Thanks for your effort

[@yik9990]

This is great. You'd help a lot of people by creating more videos again for the channel!

[@arfeenmalik8331]

Best explanation I've come across for reversing a singly linked list. Thanks !

[@stockmarketinvestingforeve6263]

Thanks, this was the best recursive explanation. Took me a while to find it!

[@kedarnadkarni4627]

This is the best Explanation so far. Hatsoff Keep up the good work !

[@alinawei7010]

your explanation is so clear, so good! please make more video (probably leetcode, so we can practice too)

[@MrZZooh]

Amazing explanation. Recursion is a little beyond me but I can appreciate it. I liked and understood the iterative way better.

[@Dev_God]

Thank you for this wonderful explanation! I think it is really helpful to use some examples to explain recursion to beginners 'cause it's really generating some confusion. Now I'm clearer about it!

[@eduardoauditore5414]

This was very helpful to me!! I did this with Ruby and it worked!! thanks for uploading this video ;)😁

[@jonmarkortiz]

Excellent, I only wish you had more whiteboard space. Toward the end things start to get to jumbled when you are reconnecting your nodes back. Again, excellent. You deserve a larger whiteboard.

[@zmanneverdie]

Very nice explanation! Thanks! Hope you can do more videos like this!

[@vasupatel635]

Amazing men. you are eloborating problem such a great way.

[@selvaganesan93]

Liked your explanation about recursion. Awesome

[@yugsoni2603]

thank you so much this is the best explanation of recursive solution.

[@tgroy1]

Amazing explanation. Thanks a lot.

[@anonymousvevo8697]

really , the best explanation ever

[@IvanyhwuWu]

i like the way you explain it! it's much easier to understand! thank!

[@ahmadsalah115]

Thank you very very much, you are a great Person

[@okachobe1]

The best explanation I've seen

[@aravindhsaairavichandran8404]

Beautiful explanation

[@sabelozwane6917]

Such a nice and clear explanation. Thanks!

[@priyam_1007]

Love you brother

[@maggiexu1780]

very clear and easy to understand!

[@akshaybhoendie]

Very well explained friend! cheers!

[@afridimajeed5897]

Beautifully done!

[@init1mk]

i used this code but the last lane of code dose not work for me > i checked with debug and their next is still null so my output will be like -> input :(f, l, o, w)
output:(f, )
can u help me to solve this problem

[@piyushsharma1638]

This is a pro explanation.nice

[@TheCCBoi]

Amazing video, I wish you would make more!

[@prashantsishodhiya4412]

Thanks allot for the awesome explanation 😃

[@CodyCoding]

awesome explanation! thanks a ton :D

[@ahmetkarakartal9563]

thank you so much!!!

[@anonymousvevo8697]

Thanks a lot mate

[@ravikrishna5204]

very well explained. Thanks so much

[@leejohn6055]

Very Detailed!!

[@jonathondelemos4609]

Brilliant

[@saupausau]

Just before you return rest, you have : "nextNode.next = curr " . I would have thought it would be rest.next = curr; (which does not work). can you explain how you came up with "nextNode.next = curr " instead of "rest.next = curr"

[@chill_cs4627]

Note that "rest.next" will point to the 2nd node in the reversed remainder of a list (this reversed remainder of the list begins at the last node in the original input list, and ends at "nextNode". To fully reverse the list, we need to incorporate "curr" into the fully reversed list. So we do "nextNode.next" = curr to append it to the end of the reversed list and make it fully reversed.

[@zenetto9158]

Amazing explanation! Keep it up!

[@mohammadasad6044]

thank you , i love you man.

[@JoshuaDueck]

I doubt I'll get a response before the assignment is due, but I keep getting a nullpointerexception when I try using this method. I have copied it exactly as you've said (not to copy your work, just to better see how it works), the only difference is that I have getLink() and setLink() methods. Any clue as to why this may be happening?

[@naomim1207]

what is the time complexity?

[@faezehdehghan5128]

Thank youuuuuuuu......that was amazing.....short but very useful.......kiss:)

[@jiamingchen7467]

Should the "return rest" be outside of the "else" bucket ?

[@tmosestdev]

One thing to note is that you don't really need the else if and the else statement. Is that something you did to increase readability?

[@chill_cs4627]

Yup, you're right that we don't need the else statement (we need the logic, but don't need to wrap it in an else-clause)! However, we do need the else-if statement, in the case of our input being a single-node linked list (can you see why?). Having looked through some implementations of this algorithm, I've noticed some of them combine the if and else-if statements to just return 'curr'. In this case, I just left the if/else-if/else in to more clearly show the different cases.

[@tmosestdev]

@@chill_cs4627 Cool thanks for the reply and the great video!

[@init1mk]

tnx ♥

[@binoysubhakumar9955]

Nailed it!

[@jeanleconteii]

Thank you!

[@mdiftekhar8407]

Gud explained

[@harshipandey1977]

complete code:goo.gl/wbdSux

[@abdallahsafi2542]

nice done

[@rayaqin]

neat

[@balajig4684]

super!

[@rydmerlin]

You don’t need else when you returning before it.

[@pinghsu520]

nice

[@tianyangren]

tkx！

[@ianchui]

subbbbbbbed

[@anonymousvevo8697]

thank you so much , why don't you male videos anymore ?

[@ShubhamKumar-fn9cl]

lol