Author: Anonymous

In a breadth-first traversal of a graph, what type of collection is used in the generic algorithm?

For a given set s, which method returns True if item is in s, or False otherwise.

In graph terms, what is a path that begins and ends at the same vertex?

Which of the following is true about graphs?

What is true about how lists are indexed?

When using a stack to evaluate the balance of brackets and parentheses in an expression, what is the final step?

What is the number of nodes in a full binary tree with a height of 4?

Which of the following is NOT a common application for a binary tree?

What are the values of a list index at the head and tail of the list, respectively?

For a key value of 93 and a hashing function of key % 46, what is the index into the array?