1. It is possible to delete a node from the middle of a tree, but the result tends to create very unbalanced trees.

Select one:

True

False

2. In a graph, a segment is called a line.

Select one:

True

False

3. A graph is a collection of nodes, called vertices, and line segments, called arcs or edges, that connect pairs of nodes.

Select one:

True

False

4. The indegree of a vertex is the number of lines incident to it.

Select one:

True

False

5. A graph is a kind of tree.

Select one:

True

False

6. In the breadth-first traversal, all of a nodes descendents are processed before moving to an adjacent node.

Select one:

True

False

7. The breadth-first traversal of a graph uses a stack rather than a queue.

Select one:

True

False

8. The adjacency matrix uses a vector for the vertices and a matrix to store the edges.

Select one:

True

False

9. The code in a breadth-first traversal begins as the depth-first algorithm does, by setting all of the processed flags to processed.

Select one:

True

False

10. In the bubble sort, the list at any moment is divided into two sublists: sorted and unsorted. The smallest element is bubbled from the unsorted sublist and moved to the sorted sublist.

Select one:

True

False