Given the Binary Search Tree of names in Figure 11.5 in the textbook:     Write the preorder, inorder and postorder traversals of this tree in the text box below.  Remember, “visiting” a node means displaying the “name” data field within that node.  Be sure to clearly label the lists of names with “preorder”, “inorder” and “postorder” (6 points).

The base case for a recursive definition of the factorial of n is ______.

A program that uses an ADT is called a(n) ______.

Write the code segment that is used to insert a new Node, referenced by the reference variable newNode, at the beginning of a linear linked list which is not empty. (5 points)

An ADT’s operations are also known as its _______.

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?