trees.py
def _point_position(self, point: Tuple[int, int]) -> Tuple[QuadTree, str]:
        """ Return the subtree in the direction that <point> is in.

        Runtime: O(log(n))
        """
        x, y = self._centre
        x1, y1 = point
        if x1 <= x and y1 <= y:
            return self._nw, 'nw'
        elif x1 > x and y1 <= y:
            return self._ne, 'ne'
        elif x1 <= x and y1 > y:
            return self._sw, 'sw'
        else:
            return self._se, 'se'
 Return the subtree in the direction that <point> is in.

        Runtime: O(log(n))
        
Return the subtree in the direction that  is in.
Return the subtree in the direction that is in .
def _point_position(self, point: Tuple[int, int]) -> Tuple[QuadTree, str]:
        x, y = self._centre
        x1, y1 = point
        if x1 <= x and y1 <= y:
            return self._nw, 'nw'
        elif x1 > x and y1 <= y:
            return self._ne, 'ne'
        elif x1 <= x and y1 > y:
            return self._sw, 'sw'
        else:
            return self._se, 'se'
def _point_position ( self , point : Tuple [ int , int ] ) -> Tuple [ QuadTree , str ] : x , y = self . _centre x1 , y1 = point if x1 <= x and y1 <= y : return self . _nw , 'nw' elif x1 > x and y1 <= y : return self . _ne , 'ne' elif x1 <= x and y1 > y : return self . _sw , 'sw' else : return self . _se , 'se'
Return the subtree in the direction that <point> is in.
Return the subtree in the direction that <point > is in .
""" Return the subtree in the direction that <point> is in.

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