Add Tower of Hanoi recursive implementation

[saignaeshdasari]

What was added

• Added a recursive implementation of the Tower of Hanoi problem
• Included clear method structure and comments for better understanding
• Placed the solution under the recursion section for consistency

Why this change

• Tower of Hanoi is a fundamental recursion problem
• Helps beginners understand recursive calls and base conditions
• Improves the completeness of recursion examples in the repository

Implementation details

• Uses a standard recursive approach
• Time Complexity: O(n)
• Space Complexity: O(n) due to recursion stack

[codecov-commenter]

Codecov Report

❌ Patch coverage is 0% with 8 lines in your changes missing coverage. Please review.
✅ Project coverage is 79.06%. Comparing base (0e8291e) to head (fde4b3b).

Files with missing lines	Patch %	Lines
...java/com/thealgorithms/recursion/TowerofHanoi.java	0.00%	8 Missing ⚠️

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #7230      +/-   ##
============================================
- Coverage     79.09%   79.06%   -0.04%     
+ Complexity     6973     6972       -1     
============================================
  Files           783      784       +1     
  Lines         22950    22958       +8     
  Branches       4512     4512              
============================================
- Hits          18152    18151       -1     
- Misses         4077     4085       +8     
- Partials        721      722       +1     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.