Need this quiz back within 1 hr

Question 1 (1 point)

Question 2 (1 point)

Note: It is recommended that you save your response as you complete each question.

Subsection

For the rooted tree shown below, match the description on the left with the correct list of vertices.

a, c, g, l, n

m, n, p, q, r

n

e, f, h, k, o, p, q, r

b, c, d, g, i, l, m, n

1. Siblings of m

2. Descendants of l

3. Leaves

4. Internal vertices

5. Ancestors of r

Save

Determine the order in which an inorder traversal visits the vertices of the rooted tree shown below.

Question 3 (1 point)

Question 4 (1 point)

i, k, d, e, b, m, n, l, g, h, c, a

m, n, i, k, l, d, e, g, h, b, c, a

i, d, k, b, e, a, m, l, n, g, c, h

i, d, b, a, h, m, l, g, c, n , h

Save

Which one of the following statements is false?

A full binary tree has an even number of vertices.

A binary tree is an m-ary with m = 2.

In an m-ary tree, each internal vertex has at most m children.

In a full m-ary tree, each internal vertex has exactly m children.

Save

Determine the order in which a preorder traversal visits the vertices of the rooted tree shown below.

Question 5 (1 point)

Question 6 (1 point)

a, b, d, i, k, e, c, g, l, m, n, h

a, b, c, d, e, g, h, i, k, l, m, n

a, b, d, e, i, k, c, g, h, l, m, n

a, b, d, i, e, k, c, g, m, l, n, h

Save

How many edges must be removed from the wheel graph W6 in order to create a spanning tree for the graph?

5

6

7

The graph does not have a spanning tree.

Save

Which of the graphs are trees?

H1 and H4 only

H2 and H3 only

H2 and H5 only

H1, H3, and H4 only

H2, H4, and H5 only

Save

Save All Responses Go To Submit Quiz