It would turn a slow search into a highly parallelised "MapReduce" problem. You trade a brief, massive burst of machine execution to keep wall-clock latency incredibly low for the human waiting at the top.
A tree structure means these scanning agents don’t just run wild. High-level nodes could aggressively prune entire branches the moment a scanning agent reports a dead end.