What are the three high-level steps to delete a Node from a linear linked list? (3 points) [Hint: Do not answer this question by writing Java code}

If the array:6, 21, 35, 3, 6, 2, 13is added to a stack, in the order given (from left to right), which of the following is at the top of the stack?

Which is not a primitive data type in Java?  [types]

If you push the letters A, C, Z, Y, X, B, D, and F onto a stack of characters in that order (from left to right), and then pop them, in what order will they be deleted from the stack? (2 points)

In Java, how do we tell the compiler that the body of a loop consists of several statements, rather than one?

How many constructors can a class have?

What does it mean for the return type of a method to be void?

Which of the following statements deletes the node that curr references in a linear linked list?

The factorial of n is equal to ______.

Using the flight map below and a stack, determine if a flight path exists from city  H to city I.  Write your answer in the textbox below.  It is only necessary for your answer to show one route, if it exists.  Show the state of the stack after each step. (2 points)   For example if the question asked: Does a flight path exist from city C to city G? Your answer could be written like this: Yes a path from city C to city G exists, the resulting stacks are C, DC, HDC, GHDC.