We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e28b4a3 commit fcd672eCopy full SHA for fcd672e
src/main/java/com/fishercoder/solutions/_1038.java
@@ -36,6 +36,7 @@ public class _1038 {
36
public static class Solution1 {
37
/**credit: https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/discuss/286725/JavaC%2B%2BPython-Revered-Inorder-Traversal*/
38
int greaterSum = 0;
39
+
40
public TreeNode bstToGst(TreeNode root) {
41
if (root.right != null) {
42
bstToGst(root.right);
0 commit comments