3. Suppose we are going to apply the greedy coloring algorithm(for each vertex in some specied order, choose the rst color notalready used by a neighbor of that vertex) to trees.
For this algorithm, would it be better to order the tree verticesin preorder or postorder? Explain your answer.
Expert Answer
An answer will be send to you shortly. . . . .