Red-black tree properties in Data Structures Theory - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a red-black tree?

A red-black tree is a type of self-balancing binary search tree where each node has a color (red or black) and the tree maintains specific properties to keep it balanced during insertions and deletions.

beginner

List the five main properties of a red-black tree.

1. Every node is either red or black.
2. The root is always black.
3. All leaves (NIL nodes) are black.
4. If a node is red, then both its children are black.
5. Every path from a node to its descendant leaves contains the same number of black nodes.

intermediate

Why must the root of a red-black tree always be black?

The root is black to help maintain the black-height property, ensuring that every path from the root to leaves has the same number of black nodes, which helps keep the tree balanced.

intermediate

What does the 'black-height' of a node mean in a red-black tree?

Black-height is the number of black nodes on any path from a node down to a leaf, including the leaf but not counting the node itself if it is black. All paths from a node to its leaves have the same black-height.

intermediate

How does the red-black tree property that 'red nodes cannot have red children' help the tree?

This property prevents two red nodes from being adjacent, which limits how unbalanced the tree can become and helps maintain overall balance for efficient operations.

Which color is the root node of a red-black tree always?

A Black

B Red

C Either red or black

D White

The root node is always black to maintain the tree's balance properties.

What color are the leaves (NIL nodes) in a red-black tree?

A Red

B Black

C Either red or black

D Green

All leaves, which are NIL nodes, are considered black in a red-black tree.

If a node is red, what can be said about its children?

A They must both be black

B One must be red and one black

C They must both be red

D They can be any color

Red nodes cannot have red children; their children must be black.

What does the black-height property ensure?

A The tree has equal numbers of red and black nodes

B All paths from root to leaves have the same number of red nodes

C All paths from root to leaves have the same number of black nodes

D The root has the highest black-height

Black-height means every path from a node to its leaves has the same number of black nodes.

Why are red-black trees important in computer science?

A They are used only for sorting numbers

B They are simple to implement but not efficient

C They use only red nodes for faster processing

D They guarantee balanced trees for fast search, insert, and delete operations

Red-black trees keep the tree balanced, ensuring operations like search, insert, and delete run efficiently.

Explain the five key properties of a red-black tree and why they matter.

Think about how these rules keep the tree balanced.

Describe how the red-black tree properties help maintain balance during insertions and deletions.

Focus on how color rules prevent the tree from becoming too tall or uneven.

Practice

1. Which of the following is NOT a property of a red-black tree?

easy

A. Every node is either red or black.

B. The root is always red.

C. All leaves (NIL nodes) are black.

D. If a node is red, then both its children are black.

Solution

1. Step 1: Recall red-black tree root color property

   The root of a red-black tree is always black, not red.

2. Step 2: Verify other properties

   All other options are correct properties: nodes are red or black, leaves are black, red nodes have black children.

3. Final Answer:

   The root is always red. -> Option B

4. Quick Check:

   Root color = black [OK]

Hint: Remember: root is always black in red-black trees [OK]

Common Mistakes:

• Thinking the root can be red
• Confusing leaf nodes with internal nodes
• Ignoring the color rule for red nodes' children

2. Which of the following correctly describes the color of leaf nodes in a red-black tree?

easy

A. Leaf nodes can be either red or black.

B. Leaf nodes have no color.

C. Leaf nodes are always red.

D. Leaf nodes are always black.

Solution

1. Step 1: Understand leaf node definition in red-black trees

   Leaves in red-black trees are NIL nodes used as placeholders and are always black.

2. Step 2: Confirm color property

   This ensures uniform black height and helps maintain balance.

3. Final Answer:

   Leaf nodes are always black. -> Option D

4. Quick Check:

   Leaf color = black [OK]

Hint: Leaves are always black NIL nodes in red-black trees [OK]

Common Mistakes:

• Assuming leaves can be red
• Confusing leaves with internal nodes
• Ignoring NIL node concept

3. Consider a red-black tree where a red node has a red child. Which property is violated?

medium

A. Property that all paths from a node to leaves have the same number of black nodes.

B. Property that the root must be black.

C. Property that red nodes cannot have red children.

D. Property that every node is either red or black.

Solution

1. Step 1: Identify the property about red nodes and their children

   Red-black trees require that if a node is red, its children must be black to avoid two reds in a row.

2. Step 2: Check which property is violated by red node having red child

   This directly violates the property forbidding red nodes from having red children.

3. Final Answer:

   Property that red nodes cannot have red children. -> Option C

4. Quick Check:

   Red node children must be black [OK]

Hint: No two red nodes can be adjacent in red-black trees [OK]

Common Mistakes:

• Confusing root color with red child rule
• Mixing black height property with red node color rule
• Ignoring the red-red parent-child restriction

4. You have a red-black tree where the black height property is violated after insertion. What is the likely cause?

medium

A. Different paths from root to leaves have different numbers of black nodes.

B. A red node has a red child.

C. The root node was colored red.

D. All leaves are not black.

Solution

1. Step 1: Understand black height property

   Black height means all paths from any node to its descendant leaves must have the same number of black nodes.

2. Step 2: Identify violation cause

   If this property is violated, it means some paths have different black node counts, causing imbalance.

3. Final Answer:

   Different paths from root to leaves have different numbers of black nodes. -> Option A

4. Quick Check:

   Black height uniformity = violated [OK]

Hint: Check black node count on all root-to-leaf paths [OK]

Common Mistakes:

• Confusing root color with black height
• Ignoring path differences in black nodes
• Assuming red-red violation causes black height error

5. You want to insert a new node into a red-black tree. After insertion, the new node is red and its parent is also red. What is the correct next step to restore red-black properties?

hard

A. Recolor the parent and uncle nodes black, and the grandparent red, then continue fixing upwards.

B. Change the new node to black immediately.

C. Delete the new node and reinsert it as black.

D. Ignore the colors; red parent and red child are allowed temporarily.

Solution

1. Step 1: Identify the violation after insertion

   New red node with red parent violates the red-red property in red-black trees.

2. Step 2: Apply the fix using recoloring

   Recolor parent and uncle black, grandparent red, then continue fixing up the tree to maintain properties.

3. Final Answer:

   Recolor the parent and uncle nodes black, and the grandparent red, then continue fixing upwards. -> Option A

4. Quick Check:

   Recoloring fixes red-red violation [OK]

Hint: Recolor parent, uncle, grandparent to fix red-red conflict [OK]

Common Mistakes:

• Changing new node color without fixing ancestors
• Deleting and reinserting unnecessarily
• Ignoring red-red violation temporarily