For reference, the RBT insertion handout has been provided….

For reference, the RBT insertion handout has been provided. Insert the letter Q into the following red-black tree, and then answer the following questions about the trace of that insertion: What node is Q originally inserted under? [pre-parent] What are the first two nodes to be recolored? List the nodes with a comma between them, i.e. “A,B”. Order doesn’t matter. [colors] What node is Q’s parent after all repairs are complete? [post-parent] How many red nodes are in the tree after all repairs are complete? [red]

Suppose the git graph of a local repository looks like this:…

Suppose the git graph of a local repository looks like this: Put the following commands in the order that we could run them in an initially empty directory to generate the output above. The semicolons between commands demark different commands which run one after another from left to right. This is real bash syntax.

For reference, the red-black tree deletion handout is availa…

For reference, the red-black tree deletion handout is available below. You are interested in removing node 30 from the following red-black tree (colors purposefully omitted). If 30 is a black node, which nodes would we need to know the color of to decide what repair operation to use?