-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path0285-InorderSuccessorInBST.cs
44 lines (42 loc) · 1.17 KB
/
0285-InorderSuccessorInBST.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
//-----------------------------------------------------------------------------
// Runtime: 104ms
// Memory Usage: 31.4 MB
// Link: https://leetcode.com/submissions/detail/379032953/
//-----------------------------------------------------------------------------
namespace LeetCode
{
/**
* Definition for a binary tree node.
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int x) { val = x; }
* }
*/
public class _0285_InorderSuccessorInBST
{
public TreeNode InorderSuccessor(TreeNode root, TreeNode p)
{
if (p.right != null)
{
p = p.right;
while (p.left != null)
p = p.left;
return p;
}
TreeNode successor = null;
while (root != null)
{
if (p.val < root.val)
{
successor = root;
root = root.left;
}
else
root = root.right;
}
return successor;
}
}
}