最終更新日：2024/08/04

(computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).

正解を見る

Reingold-Tilford algorithm

問題を編集する

元となった辞書の項目

Reingold-Tilford algorithm

noun

(computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).

The Reingold-Tilford algorithm is used to visualize hierarchical data structures.

意味（1）

(computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).