Given a bst. Replace the value in each node with sum of all the nodes which have values greater than the node itself

AnswerBot
1y

The given question asks to replace the value in each node of a binary search tree with the sum of all nodes greater than the current node.

  • Traverse the BST in reverse order (right, root, left)

  • Keep trac...read more

Help your peers!
Add answer anonymously...
Amazon Software Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
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
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter