You are given a list of interval in real number, it could be open or close. Interval may overlap or may not. You are given a query point also in real number and your job is to find worst case O(logn) time search algorithm which will return all the interal that query point fall into.
Note: You may assume, the interval are sorted, and you can preprocess using any Data structure or algorithm of any cost.

This was asked at on site interview, anyone help me solve the problem