Insert the letter D into the following red-black tree, and then answer the following questions about the trace of that insertion:   a. Which node is the new D initially inserted below? b. What are the first two nodes to be rotated through this trace? c. What are the first three nodes to be recolored through this trace? d. How many red nodes are there in the final tree after all repairs?

Consider running the junit test runner on the following class. What output do you expect to see printed to System.out before the test results are displayed by the test runner? public class MyTests { @Test public static void test1() { System.out.print(“A”); } @Test public void test2() { assertTrue(false, “Oops.”); } @Test public void test3() { assertTrue(true, “Hooray!”); System.out.print(“C”); }}

Which of the following expressions correctly creates a new object of type Comparable? Note that this interface contains a single abstract method with the signature public int compareTo(T other).

When removing the value 5 from the below Binary Search Tree, we can replace the value 5 with:

A local git repository contains the following main branch as the only branch. Commit c4 is the latest commit on that main branch. We run the following sequence of commands on this local repository: git checkout maingit branch featuregit checkout featuregit log How many commits will be listed by the final git log command?

Assess the balance factor (as defined for AVL trees) for each of the nodes in the following tree. For the most out of balance node in this tree, what is that node’s balance factor?  

In a directory with the following Makefile: bronze: silver echo “gold” while files must exist in the same directory in addition to the Makefile so that if the command make is run in this directory, it prints “gold” to the terminal?

What posture is characterized by an increase in the lumbosacral angle and has an increase pelvic tilt and hip flexion?

Suppose that you just ran a command to add a few changes to staging within your git repository. Which of the following commands can be used next, to confirm whether your previous command worked as you had intended?

Inserting a single new value into the following AVL tree might require a repair operation, depending on the specific value that’s inserted.