BST to greater sum tree | DSA Coding
BST to greater sum tree
Difficulty: MediumAccuracy: 66.73%Submissions: 16K+Points: 4
Given the root of a BST with unique node values, transform it into greater sum tree where each node contains sum of all nodes greater than that node.
Examples:
Input: root = [11, 2, 29, 1, 7, 15, 40, N, N, N, N, N, N, 35, N]
Output: [119, 137, 75, 139, 130, 104, 0, N, N, N, N, N, N, 40, N]
Explanation: Every node is replaced with the sum of nodes greater than itself.
Input: root = [2, 1, 6, N, N, 3, 7]
Output: [16, 18, 7, N, N, 13, 0]
Explanation: Every node is replaced with the sum of nodes greater than itself.
Constraints :
1 ≤ node->data ≤ 3*104
1 ≤ number of nodes ≤ 3*104
Comments
Post a Comment
Hi there,
I am ${NAME},
${Subject}
I would like to thank/suggest regarding this post.
${Description}
Please enter your description here[if willing to 😉].