nzxt red and black case

, there's a process of adjusting the color./ * * If the parent node is black, it is not violated without adjustment. * instead .... * When inserting a node. The nature of the possible destruction is (4) If a node is red, then its child node is black (2) The root node is black * Insert Repair

node's parent node is red and must violate rule 3 (because the red node is inserted by default), you need to fix the red-black tree at this point. This situation is subdivided into several cases. 4. Parent red, tertiary red paren

Deleting a node can also change the balance of the tree, and the imbalance caused by the deletion is more complex than the balance correction caused by the insertion. Simplification is a common method in algorithm analysis. Below we will want to delete the node into three main categories: to delete the node as a leaf node, to delete a node only one child node and to delete has two child nodes. There are two possible colors for deleting nodes, and they need to be treated separately. To simp

red, then it is a double red problem."Red father, Uncle Black."At first glance, the natural red Father Black Uncle does not exist.But the red Father

the same, as follows.node n is red:If the node n is red, then its child node must be black, and two children node is a leaf node (because node n can only have a non-leaf child node, so only one side is a black non-leaf child node, the other side is a black leaf knot point, So the number of

A red/black tree is a special binary search tree. It has the following five properties: 1. The root node is black. 2. Each node is either black or red. 3. the two sons of each Red node must be

the triangle, before the color transformation, through this triangle will add a black node, after the color transformation, p becomes red, X1, X2 becomes black, whether through X1 or through X2, or will add a black node. If the parent node of P is black, there will be no

The fact is always caused by the desire of man,Want to have, and when most people think the same timeIt will only become the life of posterity.ReciprocatingCited:The red and black trees were bornAh (sigh), anyway, I think so.It is slightly more mature than the original, but ears, but it shows its unique styleDescribedDemand, is the cause of the red and

The red/black tree is a binary search tree. to delete the red/black tree, follow the rules of the Binary Search Tree. To delete node Z (5), delete the minimum value of Y in the right subtree of Z and then assign the value of Y to the Z node. : Then we will consider the red

case, we simply redraw s to red. The result is all paths through s, which are those paths that previously did not pass N, with a black node missing.Figure 6:n's father, S and S's sons are all black processing4) s and S's sons are all Black, but N's father is

), BLACK);Scenario 1SetColor (y, BLACK);Scenario 1SetColor (Parentof (Parentof (x)), RED);Case 1 x =Parentof (Parentof (x));Scenario 1}else {if (x = =Rightof (Parentof (x))) {x =Parentof (x);Scenario 2Rotateleft (x);Scenario 2}SetColor (Parentof (x), BLACK);Scenario 3SetColo

The red-black tree is a self-balancing two-fork search tree, a data structure used in computer science, typically for associative arrays (Map/set in C + + STL). It was invented in 1972 by Rudolf Bayer, which he called "symmetric binary B-tree", and its modern name was obtained by Leo J. Guibas and Robert Sedgewick in a paper written in 1978. The red-

some color changes are required.To insert 50,25,75,12,6 as an example, note that node 6 is an outer descendant node, and its parent node is red.In this example, X is an outer descendant node and is a left dial hand node, and X is the outer descendant node and is the right child node, which is a symmetric case. By creating a tree with 50,25,75,87,93, and then drawing a drawing again, this is omitted.The likelihood 3:p is

One, red and black tree introductionWhat is a red-black tree? Why do you need a red-black tree?finding, inserting, deleting, finding the maximum node, finding the minimum node, finding the precursor/successor node is a common requ

2)------------TemplateclassT>voidRedblacktree//--------------The judging of the rotation condition---------------TemplateclassT>nodeif(Itemreturntheparent->lchild; }Else{Itemreturntheparent->rchild; }}//-----------Adjust the operation--------------TemplateclassT>voidRedblacktree//Discolorationcurrent->color=red; current->lchild->color=black; current->rchild->color=b