<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def overlaps_point(self, p):
 """ Returns whether some interval in the tree overlaps p. Completes in O(log n) time. :rtype: bool """

        if self.is_empty():
            return False
        return bool(self.top_node.contains_point(p))