Blog

Suppose the tree below is a valid red-black tree (colors purposefully omitted), and that you are interested in removing the number 15 from this tree. What can you say about the repairs that will be needed to repair this tree after applying the naive BST remove algorithm to remove the node 15?

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).

Suppose you have two rules in your Makefile: one that builds a library, and another that builds an application that makes use of that library. Which of these two rules should list the other as a dependency?

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

While inserting the number 11 into the following red-black tree (colors purposefully omitted), which node will you first need to check the color of, in order to determine whether this insertion creates red-black tree violation that requires repair.

Choose [A] and [B] so that the anonymous class below correctly implements this interface:public interface Task {public void execute(); }  Task myTask = new [A] () { @Override public void [B] () { System.out.println(“some work!”); }}

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?

When running git log in a local repository directory, we get the following output: commit edcff4f1e27ba7ea5c043ea0692e23b5559e3a89 (HEAD -> main) Merge: 4407dda ef9697e Author: Meena Date: Mon Jun 19 14:05:17 2025 +0000 merging feature with main commit 4407dda9c3f5bb0906bd25a55673dcced8f3d4f7 Author: Meena Date: Mon Jun 19 14:04:10 2025 +0000 commit 3 commit ef9697ea8d2ce8be328ac75fc308386d22a2c39a (feature) Author: Meena Date: Mon Jun 19 14:03:21 2025 +0000 commit 2 commit 2aadb7410052306c316a46409716dc5c3b1455fe Author: Meena Date: Mon Jun 19 14:02:50 2025 +0000 commit 1 Put the following blocks of commands in the correct order that we could run them in an initially empty directory to generate the above output. Note that the commands needed to change the contents of the tracked file are omitted.   git merge feature # assume that this leads to a merge conflict git commit -am “merging feature with main” # assume merge conflict gets resolved before this step git add * git commit -m “commit 3” git init git add * git commit -m “commit 1” git branch feature git checkout feature git checkout main git add * git commit -m “commit 2”

Balance is best when:

Trace through the removal of node M from the following Red-Black Tree. Then, answer the following questions about this trace.   a. What is the parent of O after all repairs? b. What is the color of R after all repairs (red or black)? c. How many red nodes does the tree have after all repairs? d. How many rotations are needed for all repairs?