trees.py
def contains_point(self, point: Tuple[int, int]) -> bool:
        """ Return True if a player at location <point> is stored in this tree.

        >>> tree = QuadTree((100, 100))
        >>> tree.insert('a', (150, 150))
        >>> tree.contains_point((150, 150))
        True

        Runtime: O(log(n))
        """
        x, y = self._centre
        x1, y1 = point
        if self.is_empty():
            return False
        elif self._point == point:
            return True
        elif x1 < 0 or y1 < 0 or x1 > 2 * x or y1 > 2 * y:
            return False
        else:
            subtree = self._point_position(point)[0]
            if subtree and subtree.contains_point(point):
                return True
            else:
                return False
 Return True if a player at location <point> is stored in this tree.

        >>> tree = QuadTree((100, 100))
        >>> tree.insert('a', (150, 150))
        >>> tree.contains_point((150, 150))
        True

        Runtime: O(log(n))
        
Return True if a player at location  is stored in this tree.


Return True if a player at location is stored in this tree .
def contains_point(self, point: Tuple[int, int]) -> bool:
        x, y = self._centre
        x1, y1 = point
        if self.is_empty():
            return False
        elif self._point == point:
            return True
        elif x1 < 0 or y1 < 0 or x1 > 2 * x or y1 > 2 * y:
            return False
        else:
            subtree = self._point_position(point)[0]
            if subtree and subtree.contains_point(point):
                return True
            else:
                return False
def contains_point ( self , point : Tuple [ int , int ] ) -> bool : x , y = self . _centre x1 , y1 = point if self . is_empty ( ) : return False elif self . _point == point : return True elif x1 < 0 or y1 < 0 or x1 > 2 * x or y1 > 2 * y : return False else : subtree = self . _point_position ( point ) [ 0 ] if subtree and subtree . contains_point ( point ) : return True else : return False
Return True if a player at location <point> is stored in this tree.
Return True if a player at location <point > is stored in this tree .
""" Return True if a player at location <point> is stored in this tree.

        >>> tree = QuadTree((100, 100))
        >>> tree.insert('a', (150, 150))
        >>> tree.contains_point((150, 150))
        True

        Runtime: O(log(n))
        """
self
point
Tuple[int, int]