Trace through the removal of the letter $Q$ from the following red$-$black tree. What order are the remaining nodes stepped through within a level$-$order traversal of the resulting tree $($after the removal and any needed repair algorithms are run to maintain all red$-$black tree properties$)?$ Note that only some of the values are available in the answer box, so your answer will only include those values $-$ skip all others. If a node is moved to replace another and must change color, that counts as a color change.

Drag from here:

Construct your solution here:

T

V

When deleting this node, what repair steps, if any, were taken?

$($a$)$ rotation

$($b$)$ recoloring

$($c$)$ none of the above

Select all possible options that apply.