-
Notifications
You must be signed in to change notification settings - Fork 7
/
Program.cs
44 lines (43 loc) · 1.23 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
using System;
using System.Collections.Generic;
namespace FindNearestRightNodeInBinaryTree
{
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 TreeNode FindNearestRightNode(TreeNode root, TreeNode u)
{
if(u == root) return null;
var queue = new Queue<TreeNode>();
queue.Enqueue(root);
while (queue.Count != 0)
{
var count = queue.Count;
for (int i = 0; i < count; i++)
{
var cur = queue.Dequeue();
if (cur == u)
return i == count - 1 ? null : queue.Dequeue();
if(cur.left != null) queue.Enqueue(cur.left);
if(cur.right != null) queue.Enqueue(cur.right);
}
}
return null;
}
}
}