红黑树插入实现完成，如果检测其正确性呢？

src/tree.c

@@ -1124,6 +1124,7 @@ static bool tree_rb_rebalance(struct _tree* self, struct _tree_node* node)
                 }
                 grandfather->color = RBT_RED;
                 tree_turn_right(self, grandfather);
+                break;
             }
         }
         else
@@ -1149,6 +1150,7 @@ static bool tree_rb_rebalance(struct _tree* self, struct _tree_node* node)
                 }
                 grandfather->color = RBT_RED;
                 tree_turn_left(self, grandfather);
+                break;
             }
         }
     }

test/test_tree.c

@@ -249,6 +249,6 @@ void test_rbtree_num(void)
 
 void test_tree(void)
 {
-    test_avltree_num();
-    // test_rbtree_num();
+    // test_avltree_num();
+    test_rbtree_num();
 }