bn:01894240n
Noun Concept
Categories: Continued fractions, Trees (data structures)
EN
Stern–Brocot tree  Stern-Brocot tree  Farey tree  Stern Brocot tree
EN
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 the left to the right as in a search tree. Wikipedia
Definitions
Relations
Sources
EN
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 the left to the right as in a search tree. Wikipedia
An infinite complete binary search tree whose nodes are all of the positive rational numbers Wikidata