Update red_black_tree.py

Author: lighting9999

data_structures/binary_tree/red_black_tree.py

@@ -231,7 +231,11 @@ def remove(self, label: int) -> RedBlackTree:
         True
         """
         if self.label == label:
-            if self.left and self.right:
+            if self.left and self.right:
+# It's easier to balance a node with at most one child,
+        # so we replace this node with the greatest one less than
+        # it and remove that.
+
                 value = self.left.get_max()
                 if value is not None:
                     self.label = value
@@ -268,10 +272,7 @@ def remove(self, label: int) -> RedBlackTree:
         elif self.right:
             self.right.remove(label)
         return self.parent or self
-        # It's easier to balance a node with at most one child,
-        # so we replace this node with the greatest one less than
-        # it and remove that.
-
+ 
     def _remove_repair(self) -> None:
         """Repair the coloring after removal."""
         if (