Question

Does RPM actually create a shortest path tree? Explain. What are the leaves of the tree?

Answer 1

Answer:

• Traverse tree (depth-first)
• Keep the indexes (nodes)
• add the values.
• do (1) till the end of tree.
• compare the sum and print the path and sum.

Answer 2

Explanation:

iajsnwjwjsksoqpqokamskskksos