Multiple Choice
If each parent of a tree has exactly two children, then the tree is called ___________.
A) alternating
B) binary
C) equivalent
D) complete
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q5: The nearest-neighbor algorithm constructs a(n) _ circuit
Q6: When applying the cheapest-link algorithm, do not
Q7: The _ of a vertex is the
Q8: Use the nearest-neighbor algorithm starting at vertex
Q9: A _ is a graph that contains
Q11: According to Euler's theorem, a connected graph
Q12: The following table shows the distance (in
Q13: According to Euler's theorem, the figure below
Q14: In a complete binary tree of height
Q15: A traveling salesman must visit all four