Bird
Raised Fist0
PostgreSQLquery~10 mins

Recursive CTE for hierarchical data in PostgreSQL - Interactive Code Practice

Choose your learning style10 modes available
Practice - 5 Tasks
Answer the questions below
1fill in blank
easy

Complete the code to start the recursive CTE by selecting the root nodes (where parent_id is NULL).

PostgreSQL
WITH RECURSIVE subordinates AS ( SELECT id, name, parent_id FROM employees WHERE parent_id IS [1] ) SELECT * FROM subordinates;
Drag options to blanks, or click blank then click option'
ANOT NULL
B0
C''
DNULL
Attempts:
3 left
💡 Hint
Common Mistakes
Using = NULL instead of IS NULL
Using 0 or empty string instead of NULL
2fill in blank
medium

Complete the recursive part to join employees to their subordinates by matching parent_id to id.

PostgreSQL
WITH RECURSIVE subordinates AS ( SELECT id, name, parent_id FROM employees WHERE parent_id IS NULL UNION ALL SELECT e.id, e.name, e.parent_id FROM employees e JOIN subordinates s ON e.[1] = s.id ) SELECT * FROM subordinates;
Drag options to blanks, or click blank then click option'
Aname
Bmanager_id
Cparent_id
Did
Attempts:
3 left
💡 Hint
Common Mistakes
Joining on id = id instead of parent_id = id
Using wrong column names like manager_id if not present
3fill in blank
hard

Fix the error in the recursive CTE by correctly aliasing the recursive table in the join.

PostgreSQL
WITH RECURSIVE subordinates AS ( SELECT id, name, parent_id FROM employees WHERE parent_id IS NULL UNION ALL SELECT e.id, e.name, e.parent_id FROM employees e JOIN [1] ON e.parent_id = subordinates.id ) SELECT * FROM subordinates;
Drag options to blanks, or click blank then click option'
Aemployees
Bsubordinates
Ce
Dmanagers
Attempts:
3 left
💡 Hint
Common Mistakes
Joining employees to employees instead of to subordinates
Using wrong alias names in the join
4fill in blank
hard

Fill both blanks to add a level column that increments with each recursion and start it at 1.

PostgreSQL
WITH RECURSIVE subordinates AS ( SELECT id, name, parent_id, 1 AS [1] FROM employees WHERE parent_id IS NULL UNION ALL SELECT e.id, e.name, e.parent_id, s.[2] + 1 FROM employees e JOIN subordinates s ON e.parent_id = s.id ) SELECT * FROM subordinates;
Drag options to blanks, or click blank then click option'
Alevel
Bdepth
Ccount
Drank
Attempts:
3 left
💡 Hint
Common Mistakes
Using different names for the level column in anchor and recursive parts
Starting level at 0 instead of 1
5fill in blank
hard

Fill all three blanks to select id, name, and level from the recursive CTE and order by level ascending.

PostgreSQL
WITH RECURSIVE subordinates AS ( SELECT id, name, parent_id, 1 AS level FROM employees WHERE parent_id IS NULL UNION ALL SELECT e.id, e.name, e.parent_id, s.level + 1 FROM employees e JOIN subordinates s ON e.parent_id = s.id ) SELECT [1], [2], [3] FROM subordinates ORDER BY level ASC;
Drag options to blanks, or click blank then click option'
Aid
Bname
Clevel
Dparent_id
Attempts:
3 left
💡 Hint
Common Mistakes
Selecting parent_id instead of level
Ordering by id instead of level

Practice

(1/5)
1. What is the main purpose of using a WITH RECURSIVE clause in PostgreSQL when working with hierarchical data?
easy
A. To repeatedly query related rows and build a hierarchy step-by-step
B. To create temporary tables for faster queries
C. To join two unrelated tables efficiently
D. To update multiple rows in a single statement

Solution

  1. Step 1: Understand the purpose of recursive CTEs

    Recursive CTEs allow querying hierarchical data by starting with a base case and repeatedly adding related rows.
  2. Step 2: Compare options with this purpose

    Only To repeatedly query related rows and build a hierarchy step-by-step describes this step-by-step building of hierarchy, while others describe unrelated SQL features.
  3. Final Answer:

    To repeatedly query related rows and build a hierarchy step-by-step -> Option A
  4. Quick Check:

    Recursive CTE = step-by-step hierarchy building [OK]
Hint: Recursive CTEs build hierarchies by repeating queries [OK]
Common Mistakes:
  • Confusing recursive CTE with temporary tables
  • Thinking recursive CTEs update data
  • Assuming recursive CTEs join unrelated tables
2. Which of the following is the correct basic syntax to start a recursive CTE named tree in PostgreSQL?
easy
A. RECURSIVE WITH tree AS (SELECT ... UNION ALL SELECT ...)
B. WITH RECURSIVE tree AS (SELECT ... UNION ALL SELECT ...)
C. WITH tree RECURSIVE AS (SELECT ... UNION ALL SELECT ...)
D. WITH tree AS RECURSIVE (SELECT ... UNION ALL SELECT ...)

Solution

  1. Step 1: Recall correct recursive CTE syntax

    The correct syntax starts with WITH RECURSIVE cte_name AS ( ... ).
  2. Step 2: Match options to syntax

    Only WITH RECURSIVE tree AS (SELECT ... UNION ALL SELECT ...) matches this exact syntax; others misplace the keyword RECURSIVE.
  3. Final Answer:

    WITH RECURSIVE tree AS (SELECT ... UNION ALL SELECT ...) -> Option B
  4. Quick Check:

    WITH RECURSIVE before CTE name [OK]
Hint: Start with 'WITH RECURSIVE cte_name AS' [OK]
Common Mistakes:
  • Placing RECURSIVE after CTE name
  • Using RECURSIVE inside parentheses
  • Omitting RECURSIVE keyword
3. Given the table employees(id, name, manager_id) with data:
1, 'Alice', NULL
2, 'Bob', 1
3, 'Carol', 2
What will the following query return?
WITH RECURSIVE emp_tree AS (SELECT id, name, manager_id FROM employees WHERE id = 1 UNION ALL SELECT e.id, e.name, e.manager_id FROM employees e JOIN emp_tree et ON e.manager_id = et.id) SELECT name FROM emp_tree ORDER BY id;
medium
A. Alice only
B. Carol only
C. Bob, Carol only
D. Alice, Bob, Carol

Solution

  1. Step 1: Understand base case and recursion

    The base case selects employee with id=1 (Alice). The recursive part adds employees whose manager_id matches ids in emp_tree.
  2. Step 2: Trace recursion

    First iteration adds Bob (manager_id=1), second adds Carol (manager_id=2). So all three are included.
  3. Final Answer:

    Alice, Bob, Carol -> Option D
  4. Quick Check:

    Recursive CTE collects all subordinates [OK]
Hint: Recursive CTE collects all descendants starting from base [OK]
Common Mistakes:
  • Ignoring base case rows
  • Confusing manager_id direction
  • Assuming only direct reports are included
4. Consider this recursive CTE:
WITH RECURSIVE cte AS (SELECT id, parent_id FROM items WHERE parent_id IS NULL UNION ALL SELECT i.id, i.parent_id FROM items i JOIN cte ON i.parent_id = cte.id) SELECT * FROM cte;

It returns no rows. What is the most likely cause?
medium
A. The base case SELECT returns no rows because no parent_id is NULL
B. The JOIN condition is reversed and should be cte.parent_id = i.id
C. The recursive part uses UNION instead of UNION ALL
D. The CTE is missing an ORDER BY clause

Solution

  1. Step 1: Check base case condition

    The base case selects rows where parent_id IS NULL. If none exist, base returns zero rows.
  2. Step 2: Understand recursion depends on base

    Without base rows, recursion never starts, so no rows returned.
  3. Final Answer:

    The base case SELECT returns no rows because no parent_id is NULL -> Option A
  4. Quick Check:

    Base case must return rows to start recursion [OK]
Hint: Check base case returns rows before recursion [OK]
Common Mistakes:
  • Assuming JOIN condition is wrong without checking data
  • Thinking UNION vs UNION ALL causes no rows
  • Believing ORDER BY affects recursion output
5. You have a table folders(id, name, parent_id) representing nested folders. Write a recursive CTE query to list all folders with their full path from the root, separated by '/'. Which query correctly achieves this?
hard
A. WITH RECURSIVE folder_paths AS (SELECT id, name, parent_id, name AS path FROM folders WHERE parent_id IS NOT NULL UNION ALL SELECT f.id, f.name, f.parent_id, fp.path || '/' || f.name FROM folders f JOIN folder_paths fp ON f.parent_id = fp.id) SELECT id, path FROM folder_paths ORDER BY path;
B. WITH RECURSIVE folder_paths AS (SELECT id, name, parent_id, '/' || name AS path FROM folders WHERE parent_id IS NULL UNION ALL SELECT f.id, f.name, f.parent_id, '/' || fp.path || '/' || f.name FROM folders f JOIN folder_paths fp ON f.parent_id = fp.id) SELECT id, path FROM folder_paths ORDER BY path;
C. WITH RECURSIVE folder_paths AS (SELECT id, name, parent_id, name AS path FROM folders WHERE parent_id IS NULL UNION ALL SELECT f.id, f.name, f.parent_id, fp.path || '/' || f.name FROM folders f JOIN folder_paths fp ON f.parent_id = fp.id) SELECT id, path FROM folder_paths ORDER BY path;
D. WITH RECURSIVE folder_paths AS (SELECT id, name, parent_id, name AS path FROM folders WHERE parent_id IS NULL UNION ALL SELECT f.id, f.name, f.parent_id, fp.path + '/' + f.name FROM folders f JOIN folder_paths fp ON f.parent_id = fp.id) SELECT id, path FROM folder_paths ORDER BY path;

Solution

  1. Step 1: Identify correct base case and path initialization

    The base case must select root folders (parent_id IS NULL) and set path to just the folder name without leading '/'. The recursive part builds path as parent_path || '/' || name.
  2. Step 2: Compare options with correct logic

    The correct query uses parent_id IS NULL for base, name AS path, and fp.path || '/' || f.name for recursion (PostgreSQL string concat). Distractors fail by using invalid + concat, adding extra '/' (causing '//'), or starting from non-roots (parent_id IS NOT NULL).
  3. Final Answer:

    WITH RECURSIVE folder_paths AS (SELECT id, name, parent_id, name AS path FROM folders WHERE parent_id IS NULL UNION ALL SELECT f.id, f.name, f.parent_id, fp.path || '/' || f.name FROM folders f JOIN folder_paths fp ON f.parent_id = fp.id) SELECT id, path FROM folder_paths ORDER BY path; -> Option C
  4. Quick Check:

    Use base root rows + '||' concat for paths [OK]
Hint: Use '||' for string concat and start from root folders [OK]
Common Mistakes:
  • Using '+' instead of '||' for string concatenation
  • Starting recursion from non-root folders
  • Adding extra '/' at path start
Recommended

Ready to prove it?

Pass the test and this pattern moves unknown strong while earning +1 Grip toward your certificate.

10 questions~5 mineasy hard