Remove extra blank lines

Author: dylanbuchi

Diff for: data_structures/binary_tree/red_black_tree.py

@@ -51,18 +51,13 @@ def rotate_left(self) -> RedBlackTree:
         """
         parent = self.parent
         right = self.right
-
         if right is None:
             return self
-
         self.right = right.left
-
         if self.right:
             self.right.parent = self
         self.parent = right
-
         right.left = self
-
         if parent is not None:
             if parent.left == self:
                 parent.left = right
@@ -80,14 +75,10 @@ def rotate_right(self) -> RedBlackTree:
             return self
         parent = self.parent
         left = self.left
-
         self.left = left.right
-
         if self.left:
             self.left.parent = self
-
         self.parent = left
-
         left.right = self
 
         if parent is not None:
@@ -186,7 +177,6 @@ def remove(self, label: int) -> RedBlackTree:
                     # is if both children are None leaves.
                     # We can just remove this node and call it a day.
                     if self.parent:
-
                         if self.is_left():
                             self.parent.left = None
                         else:
@@ -314,21 +304,17 @@ def check_color_properties(self) -> bool:
         """
         # I assume property 1 to hold because there is nothing that can
         # make the color be anything other than 0 or 1.
-
         # Property 2
         if self.color:
             # The root was red
             print("Property 2")
             return False
-
         # Property 3 does not need to be checked, because None is assumed
         # to be black and is all the leaves.
-
         # Property 4
         if not self.check_coloring():
             print("Property 4")
             return False
-
         # Property 5
         if self.black_height() is None:
             print("Property 5")
@@ -385,7 +371,6 @@ def search(self, label: int) -> RedBlackTree | None:
         """
         if self.label == label:
             return self
-
         elif self.label is not None and label > self.label:
             if self.right is None:
                 return None
@@ -474,7 +459,6 @@ def is_left(self) -> bool:
         """Returns true iff this node is the left child of its parent."""
         if self.parent is None:
             return False
-
         return self.parent.left is self.parent.left is self
 
     def is_right(self) -> bool:
@@ -491,7 +475,6 @@ def __len__(self) -> int:
         Return the number of nodes in this tree.
         """
         ln = 1
-
         if self.left:
             ln += len(self.left)
         if self.right: