nzxt red and black case

(O (log n)) of color changes (actually very fast) and no more than three tree rotations (two times for the insert operation). While insertions and deletions are complex, the operation time can still be maintained at O (log n) times.Insert operationWe first increment the node with a two-fork look-up tree and mark it as red. (If set to black, it will lead to the path of the root to the leaf, there is an addi

violate at most one point at a time.There are 3 cases where the red-black tree is adjusted after inserting a junction Z.Situation 1. The tertiary node y of z is red.The new node inserted in the left image Z is a red node, its parent node A is red, violates the nature of 4, so it needs to be adjusted (because the node

down these two pictures of the situation. in this case, as long as the replacement R is dyed black, it is ensured that rule 4 is not affected . The reason is that, from the tree structure before the delete operation is visible, this part contains a point pointing to the virtual edge of the red node, the previous article said that this kind of virtual edge is n

after deletion, you also need a series of processing to make the whole tree into a red black tree.Third, the red and black tree removal processRed and black tree deletion algorithm mainly has three steps3.1 Find the node to be deleted, this is a binary search tree lookup pr

1. What is a red-black tree (1) Introduction In the previous article, we introduced a two-fork search tree with a basic dynamic set operating time complexity of O (h). Unfortunately, these collection operations are faster when the binary search tree height is low, which means that when the height of the tree is high (or even if the tree becomes a 1 chain), the collection operations are not faster than exec

Red and black TreesThe red-black tree is a two-fork lookup tree , but adds a storage bit to the node's color at each node, either red or black. By limiting the shading of any one path from the root to the leaf,The

This article address: http://blog.csdn.net/cyp331203/article/details/42677833 Author: Bitter _ Coffee Welcome reprint, but reprint please indicate the source, otherwise will investigate the corresponding responsibility, thank you. The red-black tree is built on the basis of the two-fork Lookup tree, the binary lookup tree can see the "Introduction to the algorithm" binary search tree insertion and deletio

the balance factor. For a rotation animation demonstration, see Flash Animation in aVL: Http://www.cnblogs.com/abatei/archive/2008/11/17/1335031.htmlInsert nodes on the red/black tree Before discussing the insert operation of the red/black tree, you must understand that the initial color of any new node to be inserted

In the RB-DELETE, when y is black, the RB-DELETE-FIXUP function is called to adjust the color of the Red-black tree, which means that if y is red, there is no need to adjust it, next we will prove the correctness of this proposition. First, the properties of the red and

two sons. Then, identify its successor, and then copy the contents of its successor to the content of that node, and then delete its successor. Here, the successor node is equivalent to the alias, after the contents of the successor node are copied to the "Deleted node", then the successor node is deleted. This subtly transforms the problem into a "delete successor" scenario, and the following is considered for subsequent nodes. In the case of a "del

This address:http://blog.csdn.net/cyp331203/article/details/42677833Bitter _ CoffeeWelcome reprint, but reproduced please indicate the source, otherwise will be held responsible, thank you!.The red-black tree is based on a two-fork search tree, which can be found in the "Introduction to Algorithm" binary search tree insertion and deletion and the "Introduction to the algorithm" binary tree in the pre-and po

The red-black tree is a self-balancing binary lookup tree that has the complexity of finding, inserting, and deleting O (log2n) In the worst case scenario. The longest path from the root node to any leaf node in a red-black tree does not exceed twice times the shortest path

Before we learned the binary search tree, we found that in some cases its height is not very uniform, and sometimes degenerate into a long chain, so we refer to some "balanced" two-fork search tree. The red and black tree is a "balanced" two-fork search tree, which ensures that in the worst case, the time complexity of the basic dynamic set operation is O (NLGN)

(N)-> right;ElseReturn grandparent (N)-> left;} Ii. Situations of red/Black Tree InsertionScenario 1: The new node N is located on the root of the tree and has no parent node.Void insert_case1 (node N ){If (n-> parent = NULL)N-> color = black;ElseInsert_case2 (N );} Case 2: the parent node P of the new node is black