The LR-drawing-method is a method of drawing an ordered rooted binary tree based on drawing one root-to-leaf path on a vertical line and attaching recursively obtained drawings of the subtrees on the left and right. In this paper, we study how to generalize this drawing-method to trees of higher arity. We first prove that (with some careful modifications) the proof of existence of a special root-to-leaf path transfers to trees of higher arity. Then we use such paths to obtain generalized LR-drawings of trees of arbitrary arity.

翻译：LR-draw-方法是一种方法,用来根据在垂直线上绘制一条根到叶线的根树根根根树根,并附上从左、右两边的次树的图纸。在本文中,我们研究如何将这一图画方法推广到高均度树上。我们首先(经过一些仔细的修改)证明存在一种特殊的根到叶路径,转移到高均度树上。然后我们利用这些路径获取任意极性树上普遍的LR-drawing。