trees.py
def _check_bound(self, tree: QuadTree, point: Tuple[int, int]) -> bool:
        """ Return True if <point> is within the bound of the <tree>.

        === Precondition ===
        - <tree> is a subtree of self.
        - This function is only to be called on the root QuadTree.

        Runtime: O(log(n))
        """
        dep = self.depth(tree)
        if dep is not None:
            length = self._centre[0] // 2 ** dep
            return (tree._centre[0] - length < point[0] <= tree._centre[
                0] + length
                    and tree._centre[1] - length < point[1] <=
                    tree._centre[1] + length)
        else:
            return 0 < point[0] <= tree._centre[0] * 2 and 0 < point[1] <= \
                   tree._centre[1] * 2
 Return True if <point> is within the bound of the <tree>.

        === Precondition ===
        - <tree> is a subtree of self.
        - This function is only to be called on the root QuadTree.

        Runtime: O(log(n))
        
Return True if  is within the bound of the .
Precondition
 is a subtree of self.
This function is only to be called on the root QuadTree.


Return True if is within the bound of the . Precondition is a subtree of self . This function is only to be called on the root QuadTree .
def _check_bound(self, tree: QuadTree, point: Tuple[int, int]) -> bool:
        dep = self.depth(tree)
        if dep is not None:
            length = self._centre[0] // 2 ** dep
            return (tree._centre[0] - length < point[0] <= tree._centre[
                0] + length
                    and tree._centre[1] - length < point[1] <=
                    tree._centre[1] + length)
        else:
            return 0 < point[0] <= tree._centre[0] * 2 and 0 < point[1] <= \
                   tree._centre[1] * 2
def _check_bound ( self , tree : QuadTree , point : Tuple [ int , int ] ) -> bool : dep = self . depth ( tree ) if dep is not None : length = self . _centre [ 0 ] // 2 ** dep return ( tree . _centre [ 0 ] - length < point [ 0 ] <= tree . _centre [ 0 ] + length and tree . _centre [ 1 ] - length < point [ 1 ] <= tree . _centre [ 1 ] + length ) else : return 0 < point [ 0 ] <= tree . _centre [ 0 ] * 2 and 0 < point [ 1 ] <= tree . _centre [ 1 ] * 2
Return True if <point> is within the bound of the <tree>.
Return True if <point > is within the bound of the <tree > .
""" Return True if <point> is within the bound of the <tree>.

        === Precondition ===
        - <tree> is a subtree of self.
        - This function is only to be called on the root QuadTree.

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