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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/problem (Chinese)/二叉搜索树中的搜索 [search-in-a-binary-search-tree].html
View File

@@ -13,7 +13,7 @@
<b>输出：</b>[2,1,3]
</pre>
<p><strong>Example 2:</strong></p>
<p><strong>示例 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/12/tree2.jpg" style="height: 179px; width: 250px;" />
<pre>
<b>输入：</b>root = [4,2,7,1,3], val = 5
@@ -25,7 +25,7 @@
<p><strong>提示：</strong></p>
<ul>
<li>数中节点数在&nbsp;<code>[1, 5000]</code>&nbsp;范围内</li>
<li>树中节点数在&nbsp;<code>[1, 5000]</code>&nbsp;范围内</li>
<li><code>1 &lt;= Node.val &lt;= 10<sup>7</sup></code></li>
<li><code>root</code>&nbsp;是二叉搜索树</li>
<li><code>1 &lt;= val &lt;= 10<sup>7</sup></code></li>