Let your tasks take you on a journey through Melbourne's laneways.
Use a bitset to determine which lane a task belongs to, and a sum of child lanes to determine if you need to traverse a branch of the tree.