fix byg

hsjfans · hsjfans · commit 98066629c15d · 2019-05-06T23:12:42.000+08:00
diff --git a/docs/red_black_tree.md b/docs/red_black_tree.md
@@ -274,7 +274,7 @@ void insert_fix_up(RBTree t, RBTreeNode n)
         if (n->parent == n->parent->parent->left)
         {
 
-            RBTreeNode y = n->parent->parent->left;
+            RBTreeNode y = n->parent->parent->right;
             // case-1
             if (y->color == RED)
             {
@@ -298,7 +298,7 @@ void insert_fix_up(RBTree t, RBTreeNode n)
         // right subtree
         else
         {
-            RBTreeNode y = n->parent->parent->right;
+            RBTreeNode y = n->parent->parent->left;
             // case-1
             if (y->color == RED)
             {
diff --git a/src/r_b_tree.c b/src/r_b_tree.c
@@ -3,7 +3,7 @@
  * @LastEditors: hsjfans
  * @Email: hsjfans.scholar@gmail.com
  * @Date: 2019-04-26 18:27:39
- * @LastEditTime: 2019-05-06 23:09:29
+ * @LastEditTime: 2019-05-06 23:12:18
  */
 
 #include "include/r_b_tree.h"
@@ -137,7 +137,7 @@ void insert_fix_up(RBTree t, RBTreeNode n)
         if (n->parent == n->parent->parent->left)
         {
 
-            RBTreeNode y = n->parent->parent->left;
+            RBTreeNode y = n->parent->parent->right;
             // case-1
             if (y->color == RED)
             {
@@ -161,7 +161,7 @@ void insert_fix_up(RBTree t, RBTreeNode n)
         // right subtree
         else
         {
-            RBTreeNode y = n->parent->parent->right;
+            RBTreeNode y = n->parent->parent->left;
             // case-1
             if (y->color == RED)
             {

Original file line number	Diff line number	Diff line change
`@@ -274,7 +274,7 @@ void insert_fix_up(RBTree t, RBTreeNode n)`
`274`	`274`	`if (n->parent == n->parent->parent->left)`
`275`	`275`	`{`
`276`	`276`
`277`		`- RBTreeNode y = n->parent->parent->left;`
	`277`	`+ RBTreeNode y = n->parent->parent->right;`
`278`	`278`	`// case-1`
`279`	`279`	`if (y->color == RED)`
`280`	`280`	`{`
`@@ -298,7 +298,7 @@ void insert_fix_up(RBTree t, RBTreeNode n)`
`298`	`298`	`// right subtree`
`299`	`299`	`else`
`300`	`300`	`{`
`301`		`- RBTreeNode y = n->parent->parent->right;`
	`301`	`+ RBTreeNode y = n->parent->parent->left;`
`302`	`302`	`// case-1`
`303`	`303`	`if (y->color == RED)`
`304`	`304`	`{`
Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,7 @@`
`3`	`3`	`* @LastEditors: hsjfans`
`4`	`4`	`* @Email: hsjfans.scholar@gmail.com`
`5`	`5`	`* @Date: 2019-04-26 18:27:39`
`6`		`- * @LastEditTime: 2019-05-06 23:09:29`
	`6`	`+ * @LastEditTime: 2019-05-06 23:12:18`
`7`	`7`	`*/`
`8`	`8`
`9`	`9`	`#include "include/r_b_tree.h"`
`@@ -137,7 +137,7 @@ void insert_fix_up(RBTree t, RBTreeNode n)`
`137`	`137`	`if (n->parent == n->parent->parent->left)`
`138`	`138`	`{`
`139`	`139`
`140`		`- RBTreeNode y = n->parent->parent->left;`
	`140`	`+ RBTreeNode y = n->parent->parent->right;`
`141`	`141`	`// case-1`
`142`	`142`	`if (y->color == RED)`
`143`	`143`	`{`
`@@ -161,7 +161,7 @@ void insert_fix_up(RBTree t, RBTreeNode n)`
`161`	`161`	`// right subtree`
`162`	`162`	`else`
`163`	`163`	`{`
`164`		`- RBTreeNode y = n->parent->parent->right;`
	`164`	`+ RBTreeNode y = n->parent->parent->left;`
`165`	`165`	`// case-1`
`166`	`166`	`if (y->color == RED)`
`167`	`167`	`{`