recurse-parent-child-structure-from-child-to-root.md

How to read a path of an arbitrary leaf up to the root of the tree in a MySQL parent-child table with one single query

SELECT categories.name, categories.id, categories.parent_id, categories.depth
FROM (
    SELECT
                @id AS _id,
                (
                    SELECT @id := parent_id
                    FROM categories
                    WHERE id = _id
                )
        FROM (SELECT @id := 43) AS tmp1
        JOIN categories ON @id IS NOT NULL
    ) tmp2
JOIN categories ON tmp2._id = categories.id
ORDER BY categories.depth ASC