Given a binary search tree , print the path which has the sum equal to k and has minimum hops. i.e if there are multiple paths with the sum equal to k then print the path with minimum number of nodes
AnswerBot
1y
Given a binary search tree, print the path with sum k and minimum hops.
Traverse the tree using DFS and keep track of the current path and its sum.
If the current sum equals k, compare the current path ...read more
Help your peers!
Add answer anonymously...
Top Microsoft Corporation SDE (Software Development Engineer) interview questions & answers
Popular interview questions of SDE (Software Development Engineer)
Top HR questions asked in Microsoft Corporation SDE (Software Development Engineer)
>
Microsoft Corporation SDE (Software Development Engineer) Interview Questions
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
Follow us
