由于二叉树的特点是:中序遍历的结果就是排序后的结果
那么我们可以反过来遍历,让他以从大到小的顺序遍历,即 右 中 左的顺序,然后逐一改变值为累加和。
/**
* 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 sum = 0;;
public TreeNode convertBST(TreeNode root) {
dfs(root);
return root;
}
public void dfs(TreeNode root){
if(root == null) return;
dfs(root.right);
sum = sum + root.val;
root.val = sum;
dfs(root.left);
}
}