My Concise Java AC code


  • 0
    S
    public class Solution {
        private int sum = 0;
        public TreeNode convertBST(TreeNode root) {
            if (root == null) return null;
            convertBST(root.right);
            
            sum += root.val;
            root.val = sum;
            convertBST(root.left);
            return root;
        }
    }
    
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.