cartesian trees
"Cartesian trees" are binary trees that satisfy the Cartesian property, where the value at each node is greater than the values in its left subtree and smaller than the values in its right subtree. These trees are formed by a specific heap construction algorithm and can be used to efficiently perform a variety of operations like range queries and sorting. The Cartesian trees allow us to represent the order of elements in an array efficiently.
Requires login.