NQueens (Recursion)

Topic: 07. Recursion

1. Recursive Logic

• Choices: What choices do we have at each step?
• Base Case: When do we stop?

2. Decision Tree

3. Complexity

• Time: O(2^N) or similar?
• Space: O(N) (Recursion Stack Depth)

4. Code

package com.dsa.recursion;

import java.util.*;

public class NQueens {
    public void solve() {
        // TODO: Implementation
    }
}