Reingold-Tilford algorithm
Reingold-Tilford algorithm noun: an algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).
Noun
Reingold-Tilford algorithm (plural Reingold-Tilford algorithms)
- An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).
Forms of Reingold-Tilford algorithm
| plural | Reingold-Tilford algorithms |
|---|
Origin of Reingold-Tilford algorithm
Introduced in a 1981 paper by Edward Reingold and John Tilford.
Questions about Reingold-Tilford algorithm
- What does Reingold-Tilford algorithm mean?
- Reingold-Tilford algorithm means an algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).
- What part of speech is Reingold-Tilford algorithm?
- Reingold-Tilford algorithm is a noun.
- What is the plural of Reingold-Tilford algorithm?
- The plural of Reingold-Tilford algorithm is Reingold-Tilford algorithms.
Words near Reingold-Tilford algorithm in the dictionary
Source and license
Adapted from Wiktionary: Reingold-Tilford algorithm (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: “Reingold-Tilford algorithm.” Word.ws, https://word.ws/reingold-tilford_algorithm. Based on Wiktionary, CC BY-SA 4.0.
