Dynamic LCA queries on trees

Richard Cole, Ramesh Hariharan

Research output: Contribution to journalArticlepeer-review


We show how to maintain a data structure on trees which allows for the following operations, all in worst-case constant time: 1. insertion of leaves and internal nodes, 2. deletion of leaves, 3. deletion of internal nodes with only one child, 4. determining the least common ancestor of any two nodes. We also generalize the Dietz-Sleator "cup-filling" scheduling methodology, which may be of independent interest.

Original languageEnglish (US)
Pages (from-to)894-923
Number of pages30
JournalSIAM Journal on Computing
Issue number4
StatePublished - 2005


  • "cup-filling" scheduling
  • Dynamic LCA
  • LCA

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics


Dive into the research topics of 'Dynamic LCA queries on trees'. Together they form a unique fingerprint.

Cite this