SQL practice: Recursive CTEs: Queries That Call Themselves

Use a recursive CTE to produce the numbers 1 to 10, in a single column named n.

Produce every date in January 2024 as a column named day, using a recursive CTE.

Walk the employee hierarchy from the top down. Show employee_name and level, where the people with no manager are level 1. Order by level, then name.

Show each employee with a breadcrumb path from their top-level manager, like "Rajesh Kumar > Anita Sharma", in a column named path. Order by path.

Count how many people sit at each level of the hierarchy. Return level and people, ordered by level.

List everyone who reports to Rajesh Kumar, directly or indirectly. Show employee_name, ordered by name. Do not include Rajesh himself.

Starting at 1, keep doubling until the value passes 1000. Return the values in a column named n, in order.

For every branch manager, list their team: show manager_name, employee_name and level, ordered by manager_name then employee_name. A manager appears as level 1 with their own name in both columns.

A recursive CTE that walks a hierarchy has no WHERE clause in its recursive step, and the data contains a cycle: A manages B, and B manages A. What happens?