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

        Runtime: O(log(n))
        >>> tree = TwoDTree((0, 0), (500, 500))
        >>> tree.insert('a', (250, 250))
        >>> tree.contains_point((250, 250))
        True
        """
        if self.is_leaf():
            return self._point == point
        else:
            x, y = self._point
            x1, y1 = point
            if self._point == point:
                return True
            elif self._split_type == 'x':
                if x1 <= x:
                    if self._lt:
                        return self._lt.contains_point(point)
                    else:
                        return False
                else:
                    if self._gt:
                        return self._gt.contains_point(point)
                    else:
                        return False
            else:
                if y1 <= y:
                    if self._lt:
                        return self._lt.contains_point(point)
                    else:
                        return False
                else:
                    if self._gt:
                        return self._gt.contains_point(point)
                    else:
                        return False
 Return True if a player at location <point> is stored in this tree.

        Runtime: O(log(n))
        >>> tree = TwoDTree((0, 0), (500, 500))
        >>> tree.insert('a', (250, 250))
        >>> tree.contains_point((250, 250))
        True
        
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:
        if self.is_leaf():
            return self._point == point
        else:
            x, y = self._point
            x1, y1 = point
            if self._point == point:
                return True
            elif self._split_type == 'x':
                if x1 <= x:
                    if self._lt:
                        return self._lt.contains_point(point)
                    else:
                        return False
                else:
                    if self._gt:
                        return self._gt.contains_point(point)
                    else:
                        return False
            else:
                if y1 <= y:
                    if self._lt:
                        return self._lt.contains_point(point)
                    else:
                        return False
                else:
                    if self._gt:
                        return self._gt.contains_point(point)
                    else:
                        return False
def contains_point ( self , point : Tuple [ int , int ] ) -> bool : if self . is_leaf ( ) : return self . _point == point else : x , y = self . _point x1 , y1 = point if self . _point == point : return True elif self . _split_type == 'x' : if x1 <= x : if self . _lt : return self . _lt . contains_point ( point ) else : return False else : if self . _gt : return self . _gt . contains_point ( point ) else : return False else : if y1 <= y : if self . _lt : return self . _lt . contains_point ( point ) else : return False else : if self . _gt : return self . _gt . contains_point ( point ) 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.

        Runtime: O(log(n))
        >>> tree = TwoDTree((0, 0), (500, 500))
        >>> tree.insert('a', (250, 250))
        >>> tree.contains_point((250, 250))
        True
        """
self
point
Tuple[int, int]