Summarize a tree by depth
Your task
Return depth and category count for the Music tree, in ascending depth order.
After recursion produces the tree, the outer query can aggregate its rows.
Sample data
categories| id | name | parent_id |
|---|---|---|
| 1 | Music | NULL |
| 2 | Jazz | 1 |
| 3 | Indie | 1 |
| 4 | Bebop | 2 |
| 5 | Cool Jazz | 2 |
| 6 | Merch | NULL |
| 7 | Shirts | 6 |
Expected output
| depth | COUNT(*) |
|---|---|
| 0 | 1 |
| 1 | 2 |
| 2 | 2 |
Show a hint
Group the recursive result by depth and count its rows.
Recursive CTEs and hierarchies guide
Start with an anchor and a stopping rule
The anchor seeds the recursive CTE. The recursive term reads previously generated rows and produces new ones. When n reaches 16, the WHERE condition stops that branch. The final SELECT controls display order.
WITH RECURSIVE powers(n) AS (
VALUES (1)
UNION ALL
SELECT n * 2 FROM powers WHERE n < 16
)
SELECT n FROM powers ORDER BY n;Walk from a parent to its children
The categories table stores parent_id on each child. Anchor on a known category, then match the next child's parent_id to the current node's id. Carry depth alongside the ID whenever the result needs to say how far it traveled.
WITH RECURSIVE tree(id, name, depth) AS (
SELECT id, name, 0 FROM categories WHERE name = 'Music'
UNION ALL
SELECT c.id, c.name, t.depth + 1
FROM categories AS c JOIN tree AS t ON c.parent_id = t.id
)
SELECT name, depth FROM tree ORDER BY depth, name;Handle cycles in a graph
A graph can lead back to a node you already visited. For reachability, keep only the node ID in the recursive result and use UNION so duplicate nodes are discarded. Adding a changing depth column would make repeat visits distinct rows and defeat this technique.
WITH RECURSIVE reachable(node) AS (
VALUES (2)
UNION
SELECT e.target FROM edges AS e
JOIN reachable AS r ON e.source = r.node
)
SELECT node FROM reachable ORDER BY node;Worked solution
WITH RECURSIVE tree(id,depth) AS (SELECT id,0 FROM categories WHERE name='Music' UNION ALL SELECT c.id,t.depth+1 FROM categories c JOIN tree t ON c.parent_id=t.id) SELECT depth,COUNT(*) FROM tree GROUP BY depth ORDER BY depth;Press Control+Space for SQL suggestions. Use the arrow keys to select an option and Enter to insert it.
Results
Loading SQLite…
