coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 02:41:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

58
leetcode-cn/problem (English)/后继者(English) [successor-lcci].html
View File

@@ -1,29 +1,29 @@
<p>Write an algorithm to find the &quot;next&quot; node (i.e., in-order successor) of a given node in a binary search tree.</p>
<p>Return <code>null</code> if there&#39;s no &quot;next&quot; node for the given node.</p>
<p><strong>Example 1:</strong></p>
<pre>
<strong>Input:</strong> root = <code>[2,1,3], p = 1
2
/ \
1 3
</code>
<strong>Output:</strong> 2</pre>
<p><strong>Example 2:</strong></p>
<pre>
<strong>Input:</strong> root = <code>[5,3,6,2,4,null,null,1], p = 6
5
/ \
3 6
/ \
2 4
/
1
</code>
<strong>Output:</strong> null</pre>
<p>Write an algorithm to find the &quot;next&quot; node (i.e., in-order successor) of a given node in a binary search tree.</p>
<p>Return <code>null</code> if there&#39;s no &quot;next&quot; node for the given node.</p>
<p><strong>Example 1:</strong></p>
<pre>
<strong>Input:</strong> root = <code>[2,1,3], p = 1
2
/ \
1 3
</code>
<strong>Output:</strong> 2</pre>