-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path1123-LowestCommonAncestorOfDeepestLeaves.cs
52 lines (45 loc) · 1.38 KB
/
1123-LowestCommonAncestorOfDeepestLeaves.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
//-----------------------------------------------------------------------------
// Runtime: 104ms
// Memory Usage: 26.6 MB
// Link: https://leetcode.com/submissions/detail/363101945/
//-----------------------------------------------------------------------------
using System;
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 _1123_LowestCommonAncestorOfDeepestLeaves
{
private int maxDepth = 0;
private TreeNode result = null;
public TreeNode LcaDeepestLeaves(TreeNode root)
{
Helper(root, 0);
return result;
}
public int Helper(TreeNode node, int level)
{
if (node == null)
return 0;
int left = Helper(node.left, level + 1);
int right = Helper(node.right, level + 1);
if (left == right && level + left >= maxDepth)
{
maxDepth = level + left;
result = node;
}
return Math.Max(left, right) + 1;
}
}
}