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

Which type of binary tree traversal traverses the left subtree, traverses the right subtree, and then visits the root node?

Which of the following is true about graphs?

The number of edges connected to a vertex describes which of the following?

What kind of tree would be useful in analyzing the syntax of a sentence?

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

Which of the following is true about a binary tree?

What are the two fields required by the Node class in the linked implementation of a stack?

If the current state of the stack is where x is the bottom of the stack and z is the top of the stack, what is the state of the stack and the value returned after a pop operation?

What protocol are stacks said to adhere to?