This handout was developed for University of Maryland's LING 311 class, in spring 2020, as a tutorial on how to draw trees on the computer. It is a substantially revised version of a tutorial that ...
The algorithm works through a post order traversal of the tree without using recursion, thus making it a friendly choice for non-recursive languages. The nodes are assigned provisional positions at ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results