-
Notifications
You must be signed in to change notification settings - Fork 7
/
Program.cs
36 lines (34 loc) · 942 Bytes
/
Program.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
//BST倒着中序遍历一遍,正好是从大到小把所有节点走一遍,找个sum辅助记录一下每个节点应该是什么值.
using System;
namespace BinarySearchTreeToGreaterSumTree
{
public class TreeNode
{
public int val;
public TreeNode left;
public TreeNode right;
public TreeNode(int val = 0, TreeNode left = null, TreeNode right = null)
{
this.val = val;
this.left = left;
this.right = right;
}
}
class Program
{
static void Main(string[] args)
{
Console.WriteLine("Hello World!");
}
private int sum;
public TreeNode BstToGst(TreeNode root)
{
if (root == null) return null;
BstToGst(root.right);
sum += root.val;
root.val = sum;
BstToGst(root.left);
return root;
}
}
}