Added Tower of Hanoi code using recursion and a sample test

Author: Nikhilesh Satish

src/main/java/com/thealgorithms/recursion/TowerOfHanoi.java

@@ -4,17 +4,13 @@
 
 public class TowerOfHanoi {
 
-    public void solveHanoi(int n,char src,char dest,char aux)
-    {
-        if(n==1)
-        {
-            System.out.println("Move disk 1 from "+src+" to "+dest);
+    public static void solveHanoi(int n, char src, char dest, char aux) {
+        if (n == 1) {
+            System.out.println("Move disk 1 from " + src + " to " + dest);
             return;
         }
-        solveHanoi(n-1,src,aux,dest);
-        System.out.println("Move disk "+n+" from "+src+" to "+dest);
-        solveHanoi(n-1,aux,dest,src);
-
+        solveHanoi(n - 1, src, aux, dest);
+        System.out.println("Move disk " + n + " from " + src + " to " + dest);
+        solveHanoi(n - 1, aux, dest, src);
     }
-    
 }

src/test/java/com/thealgorithms/recursion/TowerOfHanoiTest.java

@@ -0,0 +1,11 @@
+package com.thealgorithms.recursion;
+
+import org.junit.jupiter.api.Test;
+
+class TowerOfHanoiTest {
+
+    @Test
+    void testSolve() {
+        TowerOfHanoi.solveHanoi(3, 'A', 'B', 'C');
+    }
+}