Embeddings of binary trees in lines
We show that any n-vertex binary tree can be embedded in a line with dilation-cost \(O(n/\log_ 2 n)\). A provided proof is fully constructive.
scientific article; zbMATH DE number 3902053