[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci
TheAlgorithms · lighting9999 · Jul 5, 2025 · Jul 5, 2025 · Jul 5, 2025 · Jul 5, 2025
commit f808b7e26ffae22131cb297e796ec7d32ea85a0c
diff --git a/data_structures/binary_tree/red_black_tree.py b/data_structures/binary_tree/red_black_tree.py
@@ -9,13 +9,13 @@ class RedBlackTree:
     """
     A Red-Black tree, which is a self-balancing BST (binary search
     tree).
-     This tree has similar performance to AVL trees, but the balancing is 
-     less strict, so it will perform faster for writing/deleting nodes 
-     and slower for reading in the average case, though, because they're 
-     both balanced binary search trees, both will get the same asymptotic 
-     performance. 
-     To read more about them, https://en.wikipedia.org/wiki/Red-black_tree 
-     Unless otherwise specified, all asymptotic runtimes are specified in 
+     This tree has similar performance to AVL trees, but the balancing is
+     less strict, so it will perform faster for writing/deleting nodes
+     and slower for reading in the average case, though, because they're
+     both balanced binary search trees, both will get the same asymptotic
+     performance.
+     To read more about them, https://en.wikipedia.org/wiki/Red-black_tree
+     Unless otherwise specified, all asymptotic runtimes are specified in
      terms of the size of the tree.
     Examples:
     >>> tree = RedBlackTree(0)