把二叉搜索树转换为累加树（递归+迭代）Java

给出二叉 搜索 树的根节点，该树的节点值各不相同，请你将其转换为累加树（Greater Sum Tree），使每个节点 node 的新值等于原树中大于或等于 node.val 的值之和。

提醒一下，二叉搜索树满足下列约束条件：

• 节点的左子树仅包含键 小于 节点键的节点。
• 节点的右子树仅包含键 大于 节点键的节点。
• 左右子树也必须是二叉搜索树
• 

 

 递归：

/**
 * 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 pre;
    public TreeNode convertBST(TreeNode root) {
        pre=0;
        find(root);
        return root;

    }
    void find(TreeNode cur){
        if(cur==null) return;
        find(cur.right);
        cur.val+=pre;
        pre=cur.val;
        find(cur.left);
    }
}

迭代：

/**
 * 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 pre;
    public TreeNode convertBST(TreeNode root) {
        pre=0;
        find(root);
        return root;

    }
    void find(TreeNode root){
        Stack <TreeNode> st=new Stack<>();
        TreeNode cur=root;
        while(cur!=null||!st.isEmpty()){
            if(cur!=null){
                st.push(cur);
                cur=cur.right;
            }else{
                cur=st.pop();
                cur.val+=pre;
                pre=cur.val;
                cur=cur.left;
            }
        }
        
    }
}