Tower of Hanoi

Write a C++ program to solve the Tower of Hanoi problem for n disks. The Tower of Hanoi consists of three rods and a number of disks of different sizes. The puzzle starts with the disks stacked on one rod in order of decreasing size, with the smallest at the top. The objective is to move the entire stack to another rod, following these rules: 1) Only one disk can be moved at a time. 2) Each move consists of taking the upper disk from one stack and placing it on top of another stack or on an empty rod. 3) No disk may be placed on top of a smaller disk.

Example 1

Input: n = 2
Output: 
  

    
Move disk 1 from rod A to rod B
    
Move disk 2 from rod A to rod C
    
Move disk 1 from rod B to rod C
  

Explanation: 
  

    
Step 1: Move smallest disk from source (A) to auxiliary rod (B)
    
Step 2: Move larger disk from source (A) to destination rod (C)
    
Step 3: Move smallest disk from auxiliary (B) to destination (C)
    
Step 4: All disks moved successfully following the rules
  

Example 2

Input: n = 3
Output: 
  

    
Move disk 1 from rod A to rod C
    
Move disk 2 from rod A to rod B
    
Move disk 1 from rod C to rod B
    
Move disk 3 from rod A to rod C
    
Move disk 1 from rod B to rod A
    
Move disk 2 from rod B to rod C
    
Move disk 1 from rod A to rod C
  

Explanation: 
  

    
Step 1: Recursively move n-1 disks from source to auxiliary rod
    
Step 2: Move largest disk from source to destination rod
    
Step 3: Recursively move n-1 disks from auxiliary to destination rod
    
Step 4: Total 2^n-1 moves required for n disks
  

Constraints

1 ≤ n ≤ 20
Time Complexity: O(2^n)
Space Complexity: O(n)