Locally finite tree
= Locally finite tree
A tree in which every vertex has finitely many incident edges; for a rooted tree this is equivalent to finitely many children per node. Induction on depth then shows every level from a single root is finite, even if the entire tree is infinite. Consequently ordinary <breadth-first tree search> can eventually reach each node, provided the elementary traversal operations terminate.