Red-black tree properties in Data Structures Theory - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Understanding the color property of Red-Black Trees

Which of the following statements correctly describes the color property of nodes in a red-black tree?

A Every node is either red or black, and the root must always be black.

B Nodes can be any color, but leaves are always black.

C Every node is either red or black, and the root must always be red.

D Only leaf nodes are colored, and internal nodes are colorless.

💡 Hint

Recall the rule about the root node's color in red-black trees.

In red-black trees, every node is colored either red or black. The root node is always black to maintain balance properties.

📋 Factual

intermediate

Black-height property of Red-Black Trees

What does the black-height property of a red-black tree ensure?

A The number of black nodes is always greater than the number of red nodes in the tree.

B All paths from a node to its descendant leaves contain the same number of red nodes.

C All paths from the root to any leaf contain the same number of black nodes.

D All paths from a node to its descendant leaves contain the same number of black nodes.

💡 Hint

Think about the balance condition related to black nodes on paths from any node.

The black-height property states that every path from a given node to its descendant leaves must have the same number of black nodes, ensuring balanced black node distribution.

🔍 Analysis

advanced

Identifying violations in Red-Black Tree properties

Given a red-black tree where a red node has a red child, which property is violated?

A The root must be black.

B All paths from a node to its leaves must have the same number of black nodes.

C Every red node must have black children.

D Leaves are always black.

💡 Hint

Recall the rule about red nodes and their children.

One key property is that red nodes cannot have red children. This prevents two reds in a row, maintaining balance.

❓ Comparison

advanced

Comparing Red-Black Tree and AVL Tree balancing

Which statement best describes the difference in balancing between red-black trees and AVL trees?

A AVL trees enforce stricter balancing than red-black trees, resulting in faster lookups but potentially slower insertions and deletions.

B Red-black trees enforce stricter balancing than AVL trees, resulting in faster insertions but slower lookups.

C Both trees enforce the same balancing rules but differ in node coloring.

D AVL trees allow red nodes, while red-black trees do not.

💡 Hint

Consider how strict each tree type is about height differences.

AVL trees maintain a stricter balance condition, which keeps the tree more balanced and improves lookup speed but can slow down insertions and deletions due to more rotations.

❓ Reasoning

expert

Calculating maximum height of a Red-Black Tree

What is the maximum height h of a red-black tree with n internal nodes?

Choose the correct formula relating h and n.

A h ≤ log₂(n + 1) / 2

B h ≤ 2 × log₂(n + 1)

C h ≤ log₂(n)

D h ≤ 3 × log₂(n + 1)

💡 Hint

Recall the property that the longest path is at most twice the shortest path in a red-black tree.

The maximum height of a red-black tree with n nodes is at most twice the logarithm base 2 of (n + 1). This is because red-black trees guarantee that no path is more than twice as long as any other.

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