/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(){}
* TreeNode(int val){ this.val = val;}
* TreeNode(int val, TreeNode left, TreeNode right){
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
int sum= 0; //Store the value of each node
public TreeNode bstToGst(TreeNode root){
helper(root);return root;}
private void helper(TreeNode root){
if(root == null)return;
//Traverse full right
helper(root.right);
//Then add the sum value with existing root val
root.val +=sum;sum= root.val;
helper(root.left);}}
1038. Binary Search Tree to Greater Sum Tree/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode