SQLQuokkaSQLQuokkaA category tree stores each node with the id of its parent in p_id; root nodes have a NULL p_id. A node is 'Root' if it has no parent, 'Inner' if it has a parent and at least one child, and 'Leaf' if it has a parent and no children. A root with no children is still 'Root'. The table can contain more than one tree. Write an SQL query that returns id and node_type for every node. Order the results by id ascending.
Loading…
Try solving the question with the schema explorer and hints first. When ready, reveal the verified canonical query and step-by-step logic breakdown.
Ask questions, share alternate queries, and explore solutions
Your recent query executions and answer checks
This will insert the verified MySQL solution into your editor so you can study how each clause transforms the table.