Multiple Choice
A tree in which a particular vertex is designated as a root is called a(n) ____ tree.
A) spanning
B) weighted
C) free
D) rooted
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q27: The _ algorithm gives the shortest distance
Q28: A minimal spanning tree of G is
Q29: The _ of sets A and B
Q30: If two edges, e<sub>1</sub> and e<sub>2</sub>, are
Q31: The two most common graph traversal algorithms
Q33: Linked lists cannot be used to implement
Q34: The edges connecting two vertices can be
Q35: We can always traverse an entire graph
Q36: A tree T is called a(n) _
Q37: A graph H is called a(n) _