comparison src/parallel_execution/RedBlackTreeReWright.cbc @ 524:3bb5da57ddb5

Fix
author Tatsuki IHA <innparusu@cr.ie.u-ryukyu.ac.jp>
date Sun, 21 Jan 2018 23:27:19 +0900
parents ac244346c85d
children
comparison
equal deleted inserted replaced
523:e28e3bd6b181 524:3bb5da57ddb5
209 tree->current->color = Red; 209 tree->current->color = Red;
210 tree->current->left->color = Black; 210 tree->current->left->color = Black;
211 tree->current->right->color = Black; 211 tree->current->right->color = Black;
212 goto stack->pop(insertBalance); 212 goto stack->pop(insertBalance);
213 213
214 } else if(tree->current->color == Black && tree->current->left->color == Red && tree->current->left->right->color == Red) { 214 } else if (tree->current->color == Black && tree->current->left->color == Red && tree->current->left->right->color == Red) {
215 struct Node* tmpCurrent = tree->current; 215 struct Node* tmpCurrent = tree->current;
216 struct Node* tmpLeft = tree->current->left; 216 struct Node* tmpLeft = tree->current->left;
217 struct Node* tmpLeftRight = tree->current->left->right; 217 struct Node* tmpLeftRight = tree->current->left->right;
218 218
219 tree->current = tmpLeft; 219 tree->current = tmpLeft;