On Cartesian trees and range minimum queries

Erik D. Demaine, Gad M. Landau, Oren Weimann

Research output: Contribution to journalArticlepeer-review


We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the range minimum query problem, a Cartesian tree for the bottleneck edge query problem on trees and undirected graphs, and a proof that no Cartesian tree exists for the two-dimensional version of the range minimum query problem.

Original languageEnglish
Pages (from-to)610-625
Number of pages16
Issue number3
StatePublished - Mar 2014

Bibliographical note

Funding Information:
G.M. Landau is partially supported by the National Science Foundation Award 0904246, Israel Science Foundation grant 347/09, Yahoo, Grant No. 2008217 from the United States-Israel Binational Science Foundation (BSF) and DFG.


  • Bottleneck paths
  • Cache-oblivious
  • Cartesian tree
  • Lowest common ancestor
  • Minimum spanning tree verification
  • Partial sums
  • Range minimum query

ASJC Scopus subject areas

  • General Computer Science
  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'On Cartesian trees and range minimum queries'. Together they form a unique fingerprint.

Cite this