I'm taking a summer course in Object-Oriented Data Structures in Java and have been steadily progressing through the first few weeks of topics.

Recursion is the subject of this week. I have had my full of fractals, Fibonacci sequence, and the infamous Towers of Hanoi problem.

https://www.youtube.com/watch?v=2SUvWfNJSsM&index=13&t=747s&list=FLW7xF0Bf8JioWmkiBXeMiDA

The video above is one of my favorite resources for visualizing the Towers of Hanoi problem, I hope you enjoy it!

Note: this is not my original content. Thank you 3Blue1Brown for creating this fantastic video.