Question

(10 points) Suppose you are given a tree about which you know nothing (i.e. there is not necessarily an order to the tree. For each of the below parts, clearly describe an algorithm to do each of the following tasks: (a) (5 points) Finding the maximal vertex label of the tree. (b) (5 points) Finding the range of the vertex labels of the tree.

          (10 points) Suppose you are given a tree about which you know nothing
(i.e. there is not necessarily an order to the tree. For each of the below
parts, clearly describe an algorithm to do each of the following tasks:
(a) (5 points) Finding the maximal vertex label of the tree.
(b) (5 points) Finding the range of the vertex labels of the tree.

(10 points) Suppose you are given a tree about which you know nothing
(i.e. there is not necessarily an order to the tree. For each of the below
parts, clearly describe an algorithm to do each of the following tasks:
(a) (5 points) Finding the maximal vertex label of the tree.
(b) (5 points) Finding the range of the vertex labels of the tree.

Added by Donald O.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Yujie Wang

Step 1

We start at any arbitrary vertex and keep track of the maximum label found so far. We visit each vertex in the tree and update the maximum label if we find a higher label. Finally, we return the maximum label found. Algorithm: Show more…

Show all steps

Thanks for your feedback!

Answer plain English please 10 points) Suppose you are given a tree about which you know nothing i.e. there is not necessarily an order to the tree. For each of the below parts, clearly describe an algorithm to do each of the following tasks: (a) (5 points) Finding the maximal vertex label of the tree. (b) (5 points) Finding the range of the vertex labels of the tree.