[FEATURE] Merge Sort Tree #2824
Description
Detailed description
A merge sort tree data structure, which supports the following operations:
-
$[l, r, k]$ : Count number of elements$< k$ (could be replaced with$\leq, >, \geq$ ) in$a_l, a_{l+1}, \dots, a_{r}$ in$O(\log^2 n)$ .
Context
Please assign this to me under hacktoberfest.
Possible implementation
No response
Additional information
No response