trees.py
def _find_point_tree(self, point: Tuple[int, int]) -> QuadTree:
        """ Return a leaf QuadTree within self that the point <point> is
        located at.

        === Precondition ===
        - The point <point> is in self.

        Runtime: O(log(n))
        """
        sub = self._point_position(point)[0]
        if sub is None:
            return self
        else:
            return sub._find_point_tree(point)
 Return a leaf QuadTree within self that the point <point> is
        located at.

        === Precondition ===
        - The point <point> is in self.

        Runtime: O(log(n))
        
Return a leaf QuadTree within self that the point  is
located at.

Precondition
The point  is in self.


Return a leaf QuadTree within self that the point is located at . Precondition The point is in self .
def _find_point_tree(self, point: Tuple[int, int]) -> QuadTree:
        sub = self._point_position(point)[0]
        if sub is None:
            return self
        else:
            return sub._find_point_tree(point)
def _find_point_tree ( self , point : Tuple [ int , int ] ) -> QuadTree : sub = self . _point_position ( point ) [ 0 ] if sub is None : return self else : return sub . _find_point_tree ( point )
Return a leaf QuadTree within self that the point <point> is
located at.
Return a leaf QuadTree within self that the point <point > is located at .
""" Return a leaf QuadTree within self that the point <point> is
        located at.

        === Precondition ===
        - The point <point> is in self.

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