Is this just an Adjacency Model table? Then this is not possible in a single request without knowing the maximum depth.
Food for Thought Managing hierarchical data in MySQL (although I'm not a fan of using a nested dataset model for data that changes regularly).
() , : , , . "" , .
: /, / "" node id (: '12/62/28/345 ', / node (345 28, 28 62 ..)), (/ ):
SELECT j.*
FROM tablename o
JOIN tablename j
WHERE j.path LIKE CONCAT (o.path,'/%')
AND j.id != o.id
WHERE o.id = <the id of the node you're looking for>;