Cartesian tree — where it appears
Named by 3 essays across 3 fields — each of them below, with the objects they name alongside it.
The table that fits inside a block
A block of six parentheses has sixty-four possible shapes and twenty-eight questions can be asked about each, so all 1,792 answers fit in a table of 9,408 bits — computed once, shared by every structure of that block length, and never counted in any of their sizes.
Two bits a value, and what undoes them
The parentheses of a range minimum over 65,536 values are 131,072 bits. Everything that makes them answerable is 651,800 more — five times the payload — and one encoding choice nobody quotes accounts for a sixth of it on its own.
The shape a range question is about
A range minimum is a question about a tree, and the tree is determined by the array. Twelve values, eleven parent links, and the answer to every one of the seventy-eight ranges is a lowest common ancestor — with the values themselves no longer needed.
Named alongside it
The objects these essays reach for when they reach for this one.
Constant factorMeasurementRange minimumSegment treeSpace overheadDocument listingLookup tableRank directorySuccinctTrade offAmortisedBlock decomposition