декартовое дерево 3

node* range(node* A, int left_face, int right_face)
{
    Pair left   = split(A, left_face);
    Pair right  = split(left.second, right_face);
    return right.first;
}