g0601_0700.s0700_search_in_a_binary_search_tree

Class Solution

java.lang.Object

g0601_0700.s0700_search_in_a_binary_search_tree.Solution

public class Solution
extends Object

700 - Search in a Binary Search Tree.

Easy

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

Find the node in the BST that the node’s value equals val and return the subtree rooted with that node. If such a node does not exist, return null.

Example 1:

Input: root = [4,2,7,1,3], val = 2

Output: [2,1,3]

Example 2:

Input: root = [4,2,7,1,3], val = 5

Output: []

Constraints:

• The number of nodes in the tree is in the range [1, 5000].
• 1 <= Node.val <= 107
• root is a binary search tree.
• 1 <= val <= 107

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
TreeNode	searchBST(TreeNode root, int val)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Solution

public Solution()

Method Detail

searchBST

public TreeNode searchBST(TreeNode root,
                          int val)