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))
def overlaps_point ( self , p ) : if self . is_empty ( ) : return False return bool ( self . top_node . contains_point ( p ) )
Returns whether some interval in the tree overlaps p.

        Completes in O(log n) time.
        :rtype: bool