Tree search provides a structured approach to explore the space of possible reasoning paths to obtain sets of candidate solutions. In a solution-level search context, each node of the search tree represents a complete solution. During the search process, an existing node is expanded into a set of child nodes, which represent new solutions that can be evaluated during verification. This expansion typically involves taking an existing solution (the parent node) and using a Large Language Model to generate variations or alternative solutions.