feat: issue #2 improves code coverage for insert_repair() from 88% to 100%

Author: ztick

data_structures/binary_tree/red_black_tree.py

@@ -604,12 +604,16 @@ def test_insert() -> bool:
     tree = RedBlackTree(0)
     tree.insert(8)
     tree.insert(-8)
+    tree.insert(-5)
+    tree.insert(-6)
     tree.insert(4)
     tree.insert(12)
     tree.insert(10)
     tree.insert(11)
     ans = RedBlackTree(0, 0)
-    ans.left = RedBlackTree(-8, 0, ans)
+    ans.left = RedBlackTree(-6, 0, ans)
+    ans.left.left = RedBlackTree(-8, 0, ans)
+    ans.left.right = RedBlackTree(-5, 0, ans)
     ans.right = RedBlackTree(8, 1, ans)
     ans.right.left = RedBlackTree(4, 0, ans.right)
     ans.right.right = RedBlackTree(11, 0, ans.right)