Given a BST find the number of pair of nodes which sum upto a given value. O(n) time, O(1) space
AnswerBot
1y
Find number of pairs of nodes in a BST that sum up to a given value in O(n) time and O(1) space.
Traverse the BST in-order and store the nodes in an array
Use two pointers approach to find pairs that su...read more
Help your peers!
Add answer anonymously...
Top Amazon Software Developer interview questions & answers
Popular interview questions of Software Developer
Top HR questions asked in Amazon Software Developer
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
