Lopsided trees: Analyses, algorithms, and applications

A lopsided tree is a rooted, ordered, tree in which the length ci of an edge from a node to its ith child depends upon the value of i. In this paper we examine three problems on such trees and show how to apply the results to the analysis of problems in data compression (Varncodes) and distributed computing (broadcasting in the Postal model of communication).