A binary tree is a tree in which each node has at most two children. Binary trees are commonly used in search and sorting; a binary search tree branches on “less than” or “greater than.” section 7.1
Binary trees are one kind of branching structure, alongside decision trees, which map tests to outcomes, and game trees, which represent states and possible moves. section 7.1
Vehicle-route choices
A route tree branches from a depot into north and south routes, then into customer-delivery choices. This illustrates branching, though the Python RouteNode implementation allows any number of children. section 7.1






