Question: Q3. How would you use breadth first search in a tree to determine the pair of leaf nodes that gives the longest path in the

Q3. How would you use breadth first search in a tree to determine the pair of leaf nodes that gives the longest path in the tree. First just describe your algorithm, without attempting to make is efficient. Then explain if you can make your algorithm efficient. What is the time complexity of your algorithm
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
