search-in-a-binary-search-tree

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given the <code>root</code> of a binary search tree (BST) and an integer <code>val</code>.

Find the node in the BST that the node&#39;s value equals <code>val</code> and return the subtree rooted with that node. If such a node does not exist, return <code>null</code>.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/12/tree1.jpg" style="width: 422px; height: 302px;" />
<pre>
Input: root = [4,2,7,1,3], val = 2
Output: [2,1,3]
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/12/tree2.jpg" style="width: 422px; height: 302px;" />
<pre>
Input: root = [4,2,7,1,3], val = 5
Output: []
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[1, 5000]</code>.</li>
	<li><code>1 &lt;= Node.val &lt;= 107</code></li>
	<li><code>root</code> is a binary search tree.</li>
	<li><code>1 &lt;= val &lt;= 107</code></li>
</ul>

searchBST

Search in a Binary Search Tree

Closest Binary Search Tree Value

closest-binary-search-tree-value

最接近的二叉搜索树值

Insert into a Binary Search Tree

insert-into-a-binary-search-tree

二叉搜索树中的插入操作

Closest Nodes Queries in a Binary Search Tree

closest-nodes-queries-in-a-binary-search-tree

二叉搜索树最近节点查询

Tree

Binary Search Tree

Binary Tree

给定二叉搜索树（BST）的根节点<meta charset="UTF-8" />&nbsp;<code>root</code>&nbsp;和一个整数值<meta charset="UTF-8" />&nbsp;<code>val</code>。

你需要在 BST 中找到节点值等于&nbsp;<code>val</code>&nbsp;的节点。 返回以该节点为根的子树。 如果节点不存在，则返回<meta charset="UTF-8" />&nbsp;<code>null</code>&nbsp;。

&nbsp;

示例 1:

<img alt="" src="https://assets.leetcode.com/uploads/2021/01/12/tree1.jpg" style="height: 179px; width: 250px;" /><meta charset="UTF-8" />

<pre>
输入：root = [4,2,7,1,3], val = 2
输出：[2,1,3]
</pre>

示例 2:
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/12/tree2.jpg" style="height: 179px; width: 250px;" />
<pre>
输入：root = [4,2,7,1,3], val = 5
输出：[]
</pre>

&nbsp;

提示：

<ul>
	<li>树中节点数在&nbsp;<code>[1, 5000]</code>&nbsp;范围内</li>
	<li><code>1 &lt;= Node.val &lt;= 107</code></li>
	<li><code>root</code>&nbsp;是二叉搜索树</li>
	<li><code>1 &lt;= val &lt;= 107</code></li>
</ul>