Ordered Labeling of Trees with Applications

Trees are the most important non-linear information structures in computer science. Fundamentally, trees captures the hierarchical relationship between information items. Many structures, such as nested sets, nested parentheses, and dictionaries, which bare no resemblance to actual trees, can be formulated as trees. There are many ways to prepresent tree structures inside a computer ([K1]).