前言
利用好二叉搜索树的特点,中序遍历是递增的,由于累加树是需要大运等于当前节点的和,为此换个思路与,反向遍历二叉树,这样就可以累加。
图片来源:图片来源
题目
源码
/**
* 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) {
if(root != null){
convertBST(root.right);
sum += root.val;
root.val=sum;
convertBST(root.left);
}
return root;
}
}