Given n intervals, its interval being [li,ri], and q query intervals, how can we find no of intervals lying inside each query interval In O(logn) ?? Can the above problem be done using segment tree/ BIT(as on net I saw it being implemented using "interval tree" something I have not learnt yet, so I was curious if an alter approach exists.