trees.py
def size(self) -> int:
        """ Return the number of nodes in <self>. For an empty tree, it still
        has size of 1.

        Runtime: O(n)
        >>> tree = TwoDTree((0, 0), (500, 500))
        >>> tree.size()
        1
        >>> tree.insert('a', (250, 250))
        >>> tree.insert('b', (150, 150))
        >>> tree.size()
        2
        """
        if self.is_leaf():
            return 1
        else:
            s = 1
            if self._lt:
                s += self._lt.size()
            if self._gt:
                s += self._gt.size()
            return s
 Return the number of nodes in <self>. For an empty tree, it still
        has size of 1.

        Runtime: O(n)
        >>> tree = TwoDTree((0, 0), (500, 500))
        >>> tree.size()
        1
        >>> tree.insert('a', (250, 250))
        >>> tree.insert('b', (150, 150))
        >>> tree.size()
        2
        
Return the number of nodes in . For an empty tree, it still
has size of 1.


Return the number of nodes in . For an empty tree it still has size of 1 .
def size(self) -> int:
        if self.is_leaf():
            return 1
        else:
            s = 1
            if self._lt:
                s += self._lt.size()
            if self._gt:
                s += self._gt.size()
            return s
def size ( self ) -> int : if self . is_leaf ( ) : return 1 else : s = 1 if self . _lt : s += self . _lt . size ( ) if self . _gt : s += self . _gt . size ( ) return s
Return the number of nodes in <self>.
Return the number of nodes in <self > .
""" Return the number of nodes in <self>. For an empty tree, it still
        has size of 1.

        Runtime: O(n)
        >>> tree = TwoDTree((0, 0), (500, 500))
        >>> tree.size()
        1
        >>> tree.insert('a', (250, 250))
        >>> tree.insert('b', (150, 150))
        >>> tree.size()
        2
        """
self