mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
33 lines
1.2 KiB
HTML
33 lines
1.2 KiB
HTML
|
<p>给定二叉搜索树（BST）的根节点<meta charset="UTF-8" /> <code>root</code> 和一个整数值<meta charset="UTF-8" /> <code>val</code>。</p>
|
|||
|
|
|
|||
|
|
<p>你需要在 BST 中找到节点值等于 <code>val</code> 的节点。 返回以该节点为根的子树。 如果节点不存在，则返回<meta charset="UTF-8" /> <code>null</code> 。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1:</strong></p>
|
|||
|
|
|
|||
|
|
<p><img alt="" src="https://assets.leetcode.com/uploads/2021/01/12/tree1.jpg" style="height: 179px; width: 250px;" /><meta charset="UTF-8" /></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<b>输入：</b>root = [4,2,7,1,3], val = 2
|
|||
|
|
<b>输出：</b>[2,1,3]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>Example 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
|
|||
|
|
<b>输出：</b>[]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>数中节点数在 <code>[1, 5000]</code> 范围内</li>
|
|||
|
|
<li><code>1 <= Node.val <= 10<sup>7</sup></code></li>
|
|||
|
|
<li><code>root</code> 是二叉搜索树</li>
|
|||
|
|
<li><code>1 <= val <= 10<sup>7</sup></code></li>
|
|||
|
|
</ul>
|