Computing on a free tree via complexity-preserving mappings

Research output: Contribution to journalArticlepeer-review

45 Scopus citations


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 canonically 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.

Original languageAmerican English
Pages (from-to)337-361
Number of pages25
Issue number1
StatePublished - Mar 1 1987

ASJC Scopus subject areas

  • General Computer Science
  • Computer Science Applications
  • Applied Mathematics


  • Ackermann's function
  • Free tree
  • Interval tree
  • Linear list
  • Query-answering
  • Range tree


Dive into the research topics of 'Computing on a free tree via complexity-preserving mappings'. Together they form a unique fingerprint.

Cite this