-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path0671-SecondMinimumNodeInABinaryTree.cs
48 lines (44 loc) · 1.34 KB
/
0671-SecondMinimumNodeInABinaryTree.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
//-----------------------------------------------------------------------------
// Runtime: 88ms
// Memory Usage: 23.9 MB
// Link: https://leetcode.com/submissions/detail/352800359/
//-----------------------------------------------------------------------------
namespace LeetCode
{
/**
* Definition for a binary tree node.
* 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;
* }
* }
*/
public class _0671_SecondMinimumNodeInABinaryTree
{
private int min = int.MaxValue;
private long result = long.MaxValue;
public int FindSecondMinimumValue(TreeNode root)
{
min = root.val;
Traverse(root);
return (result == long.MaxValue) ? -1 : (int)result;
}
private void Traverse(TreeNode node)
{
if (node == null) return;
if (node.val > result) return;
if (min < node.val && result > node.val)
result = node.val;
else
{
Traverse(node.left);
Traverse(node.right);
}
}
}
}