How do you implement a Red-Black tree in C++?

How do you implement a Red-Black tree in C++?

Algorithm

1. Let the initial tree be: Initial tree.
2. If y has a left subtree, assign x as the parent of the left subtree of y .
3. If the parent of x is NULL , make y as the root of the tree.
4. Else if x is the left child of p , make y as the left child of p .
5. Else assign y as the right child of p .
6. Make y as the parent of x .

How do you convert a 2 3 4 tree to a Red-Black tree?

1 Answer

1. Transform any 2-node in the 2-3-4 tree into a black node in the red-black tree.
2. Transform any 3-node into a child node and a parent node.
3. Transform any 4-node into a parent and two children, the first child has its own children W and X; the second child has children Y and Z.

What are the time complexities of 2 3 4 tree insertion and deletion?

2–3–4 trees are B-trees of order 4; like B-trees in general, they can search, insert and delete in O(log n) time. One property of a 2–3–4 tree is that all external nodes are at the same depth. 2–3–4 trees are an isometry of red–black trees, meaning that they are equivalent data structures.

How do you check if a tree is a red-black tree?

Check if a tree is a balanced red-black tree….Red-Black binary trees properties:

1. Every node is either red or black.
2. The root is black.
3. Every leaf (NIL) is black.
4. If a node is red, then both its children are black.
5. For each node, all simple paths from the node to descendant leaves contain the same number of black nodes.

How do you make a 2 3 4 tree?

To insert the value “25” into this 2–3–4 tree:

1. Begin at the root (10, 20) and descend towards the rightmost child (22, 24, 29). (Its interval (20, ∞) contains 25.)
2. Node (22, 24, 29) is a 4-node, so its middle element 24 is pushed up into the parent node.

What are the properties of 2-3-4 trees?

One property of a 2–3–4 tree is that all external nodes are at the same depth….Properties

• Every node (leaf or internal) is a 2-node, 3-node or a 4-node, and holds one, two, or three data elements, respectively.
• All leaves are at the same depth (the bottom level).
• All data is kept in sorted order.