In the editorial of problem:1237D - Сбалансированный плейлист i read terms like:

'binary search over segment tree in O(nlog2n), binary search over sparse table in O(nlogn), binary search over stack in O(nlogn)'

Are these general concepts(like BIT or segment tree) or only specific for this problem? If former , then Anyone who knows these concepts well , kindly explain.