应用题-二叉树专题-把二叉搜索树转换为累加树
- 版权声明：本站原创文章，于2026-04-13，由 管理员 发表。
- 转载请注明： 应用题-二叉树专题-把二叉搜索树转换为累加树 | CodeGarden
```python
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def convertBST(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
# 很显然 叠加顺序 右根左
self.value = 0
def accumulate( r ):
if not r: return
accumulate( r.right )
r.val = r.val + self.value
self.value = r.val
accumulate( r.left )
accumulate( root )
return root
```