ConceptTheory & Algos
Cartesian tree
A Cartesian tree converts the LCP array into a tree structure by taking the minimum value in the array as the root and recursing on the two sides.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Erik Demaine
Connections
7The lectures that define it or assume it, and the concepts next to it.