Stern-Brocot tree
Stern-Brocot tree noun: 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 search tree.
Noun
Stern-Brocot tree (plural Stern-Brocot trees)
- 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 search tree.
Forms of Stern-Brocot tree
| plural | Stern-Brocot trees |
|---|
Origin of Stern-Brocot tree
Introduced independently by Moritz Stern (1858) and Achille Brocot (1861).
Questions about Stern-Brocot tree
- What does Stern-Brocot tree mean?
- Stern-Brocot tree means 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 search tree.
- What part of speech is Stern-Brocot tree?
- Stern-Brocot tree is a noun.
- What is the plural of Stern-Brocot tree?
- The plural of Stern-Brocot tree is Stern-Brocot trees.
Words near Stern-Brocot tree in the dictionary
Source and license
Adapted from Wiktionary: Stern-Brocot tree (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Stern-Brocot tree.” Word.ws, https://word.ws/stern-brocot_tree. Based on Wiktionary, CC BY-SA 4.0.
