mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2026-02-02 18:39:09 +08:00
更新力扣链接
This commit is contained in:
@@ -7,7 +7,7 @@
|
||||
|
||||
# 538.把二叉搜索树转换为累加树
|
||||
|
||||
[力扣题目链接](https://leetcode-cn.com/problems/convert-bst-to-greater-tree/)
|
||||
[力扣题目链接](https://leetcode.cn/problems/convert-bst-to-greater-tree/)
|
||||
|
||||
给出二叉 搜索 树的根节点,该树的节点值各不相同,请你将其转换为累加树(Greater Sum Tree),使每个节点 node 的新值等于原树中大于或等于 node.val 的值之和。
|
||||
|
||||
|
||||
Reference in New Issue
Block a user