/**
* 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;
sumBST(root);
return root;
}
public void sumBST(TreeNode root){
if(root == null)return;
sumBST(root.right);
root.val += pre;
pre = root.val;
sumBST(root.left);
}
}
代码随想录——538. 把二叉搜索树转换为累加树
最新推荐文章于 2024-10-01 23:05:47 发布