Method get_max

data_structures/binary_tree/red_black_tree.py:402–410

Returns the largest element in this tree. This method is guaranteed to run in O(log(n)) time.

(self)

            return self.label

    def get_max(self) -> int | None:
        """Returns the largest element in this tree.
        This method is guaranteed to run in O(log(n)) time.
        """
        if self.right:
            # Go as far right as possible
            return self.right.get_max()
        else:
            return self.label

    def get_min(self) -> int | None:
        """Returns the smallest element in this tree.