Amazon Interview QuestionSDE-2s
- 0of 0 votes
In a binary tree, find and print the path with smallest weight.
Criteria: the tree contains integer values in the nodes. It may not be balanced tree. Weight is calculated by sum of values in the nodes in that path. Write code that returns the path as well as the minweight.
Interview Type: In-Person