-
Notifications
You must be signed in to change notification settings - Fork 7
/
Program.cs
64 lines (62 loc) · 1.87 KB
/
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
using System;
using System.Collections.Generic;
namespace ClosestBinarySearchTreeValue
{
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!");
}
static int ClosestValue_BFS(TreeNode root, double target)
{
var queue = new Queue<TreeNode>();
double min = double.MaxValue;
int res = 0;
queue.Enqueue(root);
while (queue.Count != 0)
{
int count = queue.Count;
for (int i = 0; i < count; i++)
{
var cur = queue.Dequeue();
min = Math.Min(min, Math.Abs(cur.val - target));
if (Math.Abs(cur.val - target) == min)
res = cur.val;
if(cur.left != null) queue.Enqueue(cur.left);
if(cur.right != null) queue.Enqueue(cur.right);
}
}
return res;
}
static int ClosestValue_DFS(TreeNode root, double target)
{
min = double.MaxValue;
DFS(root, target);
return res;
}
private static double min;
private static int res;
static void DFS(TreeNode node, double target)
{
if (node == null) return;
min = Math.Min(min, Math.Abs(node.val - target));
if (Math.Abs(node.val - target) == min)
res = node.val;
DFS(node.left, target);
DFS(node.right, target);
}
}
}