_1038.java

packagecom.fishercoder.solutions.secondthousand;

importcom.fishercoder.common.classes.TreeNode;

publicclass_1038 {
publicstaticclassSolution1 {
/*
 * credit: https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/discuss/286725/JavaC%2B%2BPython-Revered-Inorder-Traversal
 */
intgreaterSum = 0;

publicTreeNodebstToGst(TreeNoderoot) {
if (root.right != null) {
bstToGst(root.right);
 }
greaterSum = root.val = greaterSum + root.val;
if (root.left != null) {
bstToGst(root.left);
 }
returnroot;
 }
 }
}