In number theory, the Stern–Brocot tree is an infinite complete binary tree in which the vertices correspond one-for-one to the positive rational numbers, whose values are ordered from left to right as in a search tree.
The Stern–Brocot tree, and the Stern–Brocot sequences of order i for i = 1, 2, 3, 4.