Computing on a Free Tree Via Complexity-Preserving Mappings
The relationship between linear lists and free trees is studied. We examine a number of well-known data structures for computing functions on linear lists and show that they can be cononically transformed into data structures for computing the same functions defined over free trees. This is used to establish
new upper bounds on the complexity of several query-answering problems.