Lopsided trees are rooted, ordered trees in which the length of an edge from a node to its i th child depends upon the value of i . These trees model a variety of problems and have therefore been extensively studied. In this paper we combine analytic and combinatorial techniques to address three open problems on such trees: 1. Given n , characterize the combinatorial structure of a lopsided tree with n leaves that has minimal external path length. 2. Express the cost of the minimal external path length tree as a function of n . 3. Calculate exactly how many nodes of depth ≤ x exist in the infinite lopsided tree. Lopsided trees model Varn codes , prefix free codes in which the letters of the encoding alphabet can have different lengths. The solutions to the first and second problems above solve corresponding open problems on Varn codes. The solution to the third problem can be used to model the performance of broadcasting algorithms in the postal model of communication. Finding these solutions requires generalizing the definition of Fibonacci numbers and then using Mellin‐transform techniques.
