mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
51 lines
1.9 KiB
HTML
51 lines
1.9 KiB
HTML
<p>给出二叉<strong> 搜索 </strong>树的根节点，该树的节点值各不相同，请你将其转换为累加树（Greater Sum Tree），使每个节点 <code>node</code> 的新值等于原树中大于或等于 <code>node.val</code> 的值之和。</p>
|
||
|
||
<p>提醒一下，二叉搜索树满足下列约束条件：</p>
|
||
|
||
<ul>
|
||
<li>节点的左子树仅包含键<strong> 小于 </strong>节点键的节点。</li>
|
||
<li>节点的右子树仅包含键<strong> 大于</strong> 节点键的节点。</li>
|
||
<li>左右子树也必须是二叉搜索树。</li>
|
||
</ul>
|
||
|
||
<p><strong>注意：</strong>本题和 1038: <a href="https://leetcode-cn.com/problems/binary-search-tree-to-greater-sum-tree/">https://leetcode-cn.com/problems/binary-search-tree-to-greater-sum-tree/</a> 相同</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/05/03/tree.png" style="height: 364px; width: 534px;"></strong></p>
|
||
|
||
<pre><strong>输入：</strong>[4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
|
||
<strong>输出：</strong>[30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]
|
||
</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre><strong>输入：</strong>root = [0,null,1]
|
||
<strong>输出：</strong>[1,null,1]
|
||
</pre>
|
||
|
||
<p><strong>示例 3：</strong></p>
|
||
|
||
<pre><strong>输入：</strong>root = [1,0,2]
|
||
<strong>输出：</strong>[3,3,2]
|
||
</pre>
|
||
|
||
<p><strong>示例 4：</strong></p>
|
||
|
||
<pre><strong>输入：</strong>root = [3,2,4,1]
|
||
<strong>输出：</strong>[7,9,4,10]
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li>树中的节点数介于 <code>0</code> 和 <code>10<sup>4</sup></code><sup> </sup>之间。</li>
|
||
<li>每个节点的值介于 <code>-10<sup>4</sup></code> 和 <code>10<sup>4</sup></code> 之间。</li>
|
||
<li>树中的所有值 <strong>互不相同</strong> 。</li>
|
||
<li>给定的树为二叉搜索树。</li>
|
||
</ul>
|