Make code more lesbar

realshouzy · May 11, 2024 · a86c66d · a86c66d
1 parent b802534
commit a86c66d
Showing 1 changed file with 4 additions and 8 deletions.
diff --git a/nrw/datastructures/_binary_search_tree.py b/nrw/datastructures/_binary_search_tree.py
@@ -66,9 +66,7 @@ def __repr__(self) -> str:
         return f"{self.__class__.__name__}(node={self._node!r})"
 
     def __str__(self) -> str:
-        if self.is_empty:
-            return ""
-        return str(self._node)
+        return str(self._node) if not self.is_empty else ""
 
     @property
     def is_empty(self) -> bool:
@@ -178,11 +176,9 @@ def _ancestor_of_small_right(self) -> BinarySearchTree[ComparableContentT]:
         Nachfolger mehr hat. Es ist also später möglich, in einem Baum im
         rechten Nachfolger den Vorgänger des linkesten Nachfolgers zu finden.
         """
-        return (
-            self
-            if self._node_of_left_successor._left.is_empty
-            else self._node._left._ancestor_of_small_right()
-        )
+        if self._node_of_left_successor._left.is_empty:
+            return self
+        return self._node._left._ancestor_of_small_right()
 
     @property
     def _node_of_left_successor(self) -> _BSTNode[ComparableContentT] | None: