In number theory, the Stern–Brocot tree is an infinite complete binary tree whose vertices correspond one-for-one to the positive rational numbers, whose values are ordered from the left to the right as in a binary search tree. The Stern–Brocot tree was introduced independently by Moritz Stern (1858) and Achille Brocot (1861).
In number theory, the Stern–Brocot tree is an infinite complete binary tree whose vertices correspond one-for-one to the positive rational numbers, whose values are ordered from the left to the right as in a binary search tree. The Stern–Brocot tree was introduced independently by Moritz Stern (1858) and Achille Brocot (1861).
Source: Wikipedia "Stern–Brocot tree" · CC BY-SA 4.0
Share this article: X · Bluesky