-
Notifications
You must be signed in to change notification settings - Fork 7
/
Program.cs
63 lines (61 loc) · 1.82 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
using System;
using System.Collections.Generic;
namespace FindLargestValueInEachTreeRow
{
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!");
}
public IList<int> LargestValues_BFS(TreeNode root)
{
var res = new List<int>();
if (root == null) return res;
var queue = new Queue<TreeNode>();
queue.Enqueue(root);
while (queue.Count != 0)
{
int count = queue.Count;
int max = int.MinValue;
while (count != 0)
{
var current = queue.Dequeue();
max = Math.Max(max, current.val);
if(current.left != null) queue.Enqueue(current.left);
if(current.right != null) queue.Enqueue(current.right);
count--;
}
res.Add(max);
}
return res;
}
public IList<int> LargestValues_DFS(TreeNode root)
{
var res = new List<int>();
DFS(root, 0, res);
return res;
}
public void DFS(TreeNode node, int level, List<int> res)
{
if(node == null) return;
if (res.Count <= level)
res.Add(int.MinValue);
DFS(node.left, level + 1, res);
DFS(node.right, level + 1, res);
res[level] = Math.Max(res[level], node.val);
}
}
}