/*
中序遍历反向操作,遍历右子树、根节点、左子树
*/
class Solution {
TreeNode pre = null;
int sum = 0;
public TreeNode convertBST(TreeNode root) {
rInorder(root);
return root;
}
public void rInorder(TreeNode root) {
if (root == null) return;
rInorder(root.right);
if (pre == null) {
pre = root;
sum += root.val;
}
else {
root.val = root.val + sum;
sum = root.val;
}
rInorder(root.left);
}
}
把二叉搜索树转换为累加树
最新推荐文章于 2023-03-02 22:32:28 发布