On Cartesian Trees and Range Minimum Queries
On Cartesian Trees and Range Minimum Queries
复制标题
关于笛卡尔树和范围最小查询
作者：
E. Demaine;G. M. Landau;Oren Weimann
我们提出了新的笛卡尔树的范围最小查询和瓶颈边查询的应用结果。我们引入了一个高速缓存无关笛卡尔树解决范围最小查询问题，笛卡尔树的瓶颈边查询问题的树和无向图，并证明没有笛卡尔树存在的二维版本的范围最小查询问题。
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.