Abstract
The authors solve the problem of the structural arrangement of embeddings of full rooted binary and ternary trees with \(k\) , \(k=1,2,\ldots\) , levels into rectangular lattices (RL) with minimal length and close to minimal height. It is assumed that different vertices of the tree go to different (main) vertices of the RL; the leaves of the tree go to the vertices of the RL on its horizontal sides. It is also assumed that the edges of the tree go to simple (transit) chains of RL connecting the images of their end vertices and not going through other main vertices; no more than one (respectively, two) transit chains pass through one and the same edge (one and the same vertex) of the RL.
